# Hypergraph regularity and the multidimensional Szemerédi theorem

@article{Gowers2007HypergraphRA, title={Hypergraph regularity and the multidimensional Szemer{\'e}di theorem}, author={William T. Gowers}, journal={Annals of Mathematics}, year={2007}, volume={166}, pages={897-946} }

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 Szemeredi theorem of Furstenberg and Katznelson, and the first proof that provides an explicit bound. Similar results with the same consequences have been obtained independently by Nagle, Rodl, Schacht and Skokan.

## 380 Citations

Density theorems and extremal hypergraph problems

- Mathematics
- 2006

We present alternative proofs of density versions of some combinatorial partition theorems originally obtained by E. Szemerédi, H. Furstenberg and Y. Katznelson. These proofs are based on an extremal…

Regular Partitions of Hypergraphs: Regularity Lemmas

- MathematicsCombinatorics, Probability and Computing
- 2007

The objective of this paper is to extend the techniques developed by Nagle, Skokan, and the authors and obtain a stronger and more ‘user-friendly’ regularity lemma for hypergraphs.

Extremal Hypergraph Problems and the Regularity Method

- Mathematics
- 2006

Szemeredi’s regularity lemma asserts that every graph can be decomposed into relatively few random-like subgraphs. This random-like behavior enables one to find and enumerate subgraphs of a given…

Szemerédi's Regularity Lemma via Martingales

- Mathematics, Computer ScienceElectron. J. Comb.
- 2016

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$.

Density Theorems and Extremal Hypergraph Problems Density Theorems and Extremal Hypergraph Problems

- Mathematics
- 2007

We present alternative proofs of density versions of some combinatorial partition theorems originally obtained by H. Furstenberg and Y. Katznelson. These proofs are based on an extremal hypergraph…

An algorithmic hypergraph regularity lemma

- Mathematics, Computer ScienceSODA
- 2016

A constructive proof of a regularity lemma for hypergraphs is given, which asserts that all large graphs admit bounded partitions of their edge sets, most classes of which consist of uniformly distributed edges.

Szemerédi's regularity lemma revisited

- MathematicsContributions 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$.

A Tight Bound for Hyperaph Regularity

- MathematicsGeometric and Functional Analysis
- 2019

The hypergraph regularity lemma—the extension of Szemeredi’s graph regularity lemma to the setting of k-uniform hypergraphs—is one of the most celebrated combinatorial results obtained in the past…

Regularity Lemmas for Graphs

- Mathematics
- 2010

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 Lemma for the Analyst

- Mathematics
- 2007

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…

## References

SHOWING 1-10 OF 14 REFERENCES

Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs

- MathematicsCombinatorics, Probability and Computing
- 2006

A combination of regularity and counting lemmas for 3-uniform hypergraphs gives a new proof of a theorem of Frankl and Rödl, of which Szemerédi's theorem for arithmetic progressions of length 4 is a notable consequence.

The ergodic theoretical proof of Szemerédi's theorem

- Mathematics
- 1982

Partial results were obtained previously by K. F. Roth (1952) who established the existence of arithmetic progressions of length three in subsets of Z of positive upper density, and by E. Szemeredi…

A new proof of Szemerédi's theorem

- Mathematics
- 2001

In 1927 van der Waerden published his celebrated theorem on arithmetic progressions, which states that if the positive integers are partitioned into finitely many classes, then at least one of these…

Regular Partitions of Graphs

- Mathematics
- 1975

Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph…

The counting lemma for regular k-uniform hypergraphs

- Mathematics
- 2006

Szemeredi's Regularity Lemma proved to be a powerful tool in the area of extremal graph theory. Many of its applications are based on its accompanying Counting Lemma: If G is an e-partite graph with…

Regularity Lemma for k-uniform hypergraphs

- Mathematics, Computer ScienceRandom Struct. Algorithms
- 2004

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.

Note on a Generalization of Roth’s Theorem

- Mathematics
- 2003

We give a simple proof that for sufficiently large N, every subset of of size[N 2]of size at least δN 2 contains three points of the form (a,b), (a + d, b), (a, b + d).

An ergodic Szemerédi theorem for commuting transformations

- Mathematics
- 1978

The classical Poincar6 recurrence theorem asserts that under the action of a measure preserving transformation T of a finite measure space (X, ~, p.), every set A of positive measure recurs in the…

On a problem of Gowers

- Mathematics
- 2005

We prove that every set of cardinality at least contains a triple of the form , where 0$ SRC=http://ej.iop.org/images/1064-5632/70/2/A07/tex_im_2316_img4.gif/>, 0$…