Skip to main content
SpringerLink
Log in

Szemerédi’s Lemma for the Analyst

  • Published:
GAFA Geometric And Functional Analysis Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Mathematics, Eötvös Loránd University, Pázmány Péter Sétány 1/C, H-1117, Budapest, Hungary

    László Lovász

  2. Department of Mathematics, University of Toronto, Toronto, Ontario, Canada, M5S 2E4

    Balázs Szegedy

Authors
  1. László Lovász
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Balázs Szegedy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to László Lovász.

Additional information

Received: February 2006 Revision: April 2006 Accepted: April 2006

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00039-007-0599-6

Keywords and phrases:

AMS Mathematics Subject Classification:

Search

Navigation