Szemerédi’s Regularity Lemma and Quasi-randomness

By Yoshiharu Kohayakawa, Vojtech Rödl. 2003

98 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/25b4e2d02bc4cf9ed15145f34eb507157818db1c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Mathias Schacht
2. Wojciech Samotij
3. David Conlon
4. Oliver Riordan
5. Béla Bollobás
6. Remco van der Hofstad
7. William T. Gowers
8. Sourav Chatterjee

In Discrete Mathematics and Combinatorics

1. Wojciech Samotij
2. David Conlon
3. Mathias Schacht
4. Béla Bollobás
5. Oliver Riordan
6. William T. Gowers
7. A. Sah
8. Peter Keevash

In Geometry and Topology

1. David Conlon
2. Wojciech Samotij
3. Mathias Schacht
4. Oliver Riordan
5. Béla Bollobás
6. William T. Gowers
7. A. Sah
8. Terence Tao

Citations in the corpus

• On the KŁR conjecture in random graphs (2013, background): “The graphs to which the Kohayakawa–Rödl regularity lemma applies are the so-called upper-uniform graphs [51].”
• Metrics for sparse graphs (2007, methodology): “We shall include a proof here as we state the result in a slightly different way (which makes no real difference), and the use of kernels allows one to phrase the proof a little more simply than in [32] or [24].”