Abstract.
Szemerédi’s regularity lemma is a fundamental tool in graph theory: it has many applications to extremal graph theory, graph property testing, combinatorial number theory, etc. The goal of this paper is to point out that Szemerédi’s lemma can be thought of as a result in analysis. We show three different analytic interpretations.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: February 2006 Revision: April 2006 Accepted: April 2006
Rights and permissions
About this article
Cite this article
Lovász, L., Szegedy, B. Szemerédi’s Lemma for the Analyst. GAFA, Geom. funct. anal. 17, 252–270 (2007). https://doi.org/10.1007/s00039-007-0599-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00039-007-0599-6