Skip to main content
Book Chapter

Szemerédi’s Regularity Lemma and Quasi-randomness

  • Kohayakawa Y
  • Rödl V
Springer New York, (2003), 289-351
DOI: 10.1007/0-387-22444-0_9
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Kohayakawa, Y., & Rödl, V. (2003). Szemerédi’s Regularity Lemma and Quasi-randomness. In Recent Advances in Algorithms and Combinatorics (pp. 289–351). Springer New York. https://doi.org/10.1007/0-387-22444-0_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free