Szemerédi’s Lemma for the Analyst

  title={Szemer{\'e}di’s Lemma for the Analyst},
  author={L{\'a}szl{\'o} Mikl{\'o}s Lov{\'a}sz and Bal{\'a}zs Szegedy},
  journal={GAFA Geometric And Functional Analysis},
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. 

Regularity Lemmas for Graphs

Szemeredi’s regularity lemma proved to be a fundamental result in modern graph theory. It had a number of important applications and is a widely used tool in extremal combinatorics. For some further

Szemerédi's Regularity Lemma via Martingales

A variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, is proved, which applies to a number of structures and works for random variables in $L_p$ for any $p>1$.

Regularity lemmas in a Banach space setting

Regular partitions of gentle graphs

This work surveys several refinements of Szemerédi's Regularity Lemma for special, more structured classes of graphs and stresses the link to the theory of (structural) sparsity, which leads to alternative proofs, refinements and solutions of open problems.

Regularity Partitions and The Topology of Graphons

It is proved that if a graphon has an excluded induced sub-bigraph then the underlying metric space is compact and has finite packing dimension, which implies that such graphons have regularity partitions of polynomial size.

The graph theoretic moment problem

We study an analogue of the classical moment problem in the framework where moments are indexed by graphs instead of natural numbers. We study limit objects of graph sequences where edges are labeled

An analytic approach to stability

On derivatives of graphon parameters




Szemerédi's regularity lemma revisited

  • T. Tao
  • Mathematics
    Contributions Discret. Math.
  • 2006
This lemma of Szemer'edi's regularity lemma is revisited from the perspective of probability theory and information theory instead of graph theory, and a variant of this lemma which introduces a new parameter $F$.

Szemerédi’s Regularity Lemma and Quasi-randomness

A beautiful result of Szemeredi on the asymptotic structure of graphs is his regularity lemma. Roughly speaking, this result tells us that any large graph may be written as a union of induced, random

Szemeredi''s Regularity Lemma and its applications in graph theory

Szemer\''edi''s Regularity Lemma is an important tool in discrete mathematics. It says that, in some sense, all graphs can be approximated by random-looking graphs. Therefore the lemma helps in

Hypergraph regularity and the multidimensional Szemerédi theorem

We prove analogues for hypergraphs of Szemeredi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional

Regularity Lemma for k‐uniform hypergraphs

This paper presents a generalization of Szemerédi's Regularity Lemma to k‐uniform hypergraphs and results were recently independently and alternatively obtained by W. T. Gowers.

Limits of dense graph sequences

Lower bounds of tower type for Szemerédi's uniformity lemma

This paper shows that the bound is necessarily of tower type, obtaining a lower bound given by a tower of 2s of height proportional to $ \log{(1/ \epsilon)} $).

Recent advances in algorithms and combinatorics

The Matching Lattice: M.H. de Carvalho, C.L. Lucchesi, U.S.R. Murty.- Discrete Mathematics and Radio Channel Assignment: C. McDiarmid.- On the Coloration of Perfect Graphs: F. Maffray.- Algorithmic

Every monotone graph property is testable

It is shown that any monotone graph property can be tested with one-sided error, and with query complexity depending only on ε, and this result implies the testability of well-studied graph properties that were previously not known to be testable.

Quick Approximation to Matrices and Applications

The matrix approximation is generalized to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems and the Regularity Lemma is derived.