Regularity Lemmas for Graphs
By Vojtech Rödl, Mathias Schacht. 2010
58 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics
View Paper: https://www.semanticscholar.org/paper/c24de65542e72b0d17fd45f174b924bff21bf16e
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
- Robert Morris
- Wojciech Samotij
- Mathias Schacht
- David Conlon
- Simon Griffiths
- Yoshiharu Kohayakawa
- William T. Gowers
- Peter Allen
In Discrete Mathematics and Combinatorics
- Robert Morris
- Wojciech Samotij
- David Conlon
- Mathias Schacht
- Simon Griffiths
- Yoshiharu Kohayakawa
- A. Sah
- William T. Gowers
Citations in the corpus
- The chromatic thresholds of graphs (2011, background): “The lemma has turned out to have an enormous number of applications, and many important extensions and variations have been proved (see for example [17, 23, 29, 34] and the references therein).”
- On the KŁR conjecture in random graphs (2013, background): “Szemerédi’s regularity lemma [83], which played a crucial role in Szemerédi’s proof of the Erdős–Turán conjecture [82] on long arithmetic progressions in dense subsets of the integers, is one of the most important tools in extremal graph theory (see [57, 58, 73]).”