Regularity Lemmas for Graphs

@inproceedings{Schacht2009RegularityLF,
  title={Regularity Lemmas for Graphs},
  author={Mathias Schacht},
  year={2009}
}
Szemerédi’s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal combinatorics. For some applications variants of the regularity lemma were considered. Here we discuss several of those variants and their relation to each other. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 40 references

Lower bounds of tower type for Szemerédi’s uniformity lemma

  • W. T. Gowers
  • Geom. Funct. Anal. 7
  • 1997
Highly Influential
6 Excerpts

Triple systems with no six points carrying three triangles

  • I. Z. Ruzsa, E. Szemerédi
  • Combinatorics
  • 1976
Highly Influential
8 Excerpts

On some sequences of integers

  • P. Erdős, P. Turán
  • J. London. Math. Soc. 11
  • 1936
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…