136340-Thumbnail Image.png
Description

This paper focuses on the Szemerédi regularity lemma, a result in the field of extremal graph theory. The lemma says that every graph can be partitioned into bounded equal parts such that most edges of the graph span these partitions, and these edges are distributed in a fairly uniform way.

322.04 KB application/pdf

Download restricted. Please sign in.

Download count: 0

Details

Date Created
2015-05
Resource Type
  • Text
  • Machine-readable links