Hypergraph regularity and the multidimensional Szemerédi theorem

Annals of Mathematics

Volumn 166, Issue 3, 2007, Pages 897-946

  Gowers, W T ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41549141368     PISSN: 0003486X     EISSN: None     Source Type: Journal    
DOI: 10.4007/annals.2007.166.897     Document Type: Article

References (16)

1. H. FURSTENBERG and Y. KATZNELSON, An ergodic Szemerédi theorem for commuting transformations, J. Analyse Math. 34 (1978), 275-291.
2. H. FURSTENBERG, Y. KATZNELSON, and D. ORNSTEIN, The ergodic theoretical proof of Szemerédi's theorem, Bull. Amer. Math. Soc. 7 (1982), 527-552.
3. W. T. GOWERS, A new proof of Szemerédi's theorem, Geom. Fund. Anal. 11 (2001), 465-588.
4. _, Quasirandomness, counting and regularity for 3-uniform hypergraphs, Combin. Probab. Comput. 15 (2006), 143-184.
5. B. NAGLE, V. RÖDL, and M. SCHACHT, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms 28 (2006), 113i-179.
6. V. RÖDL, Some developments in Ramsey theory, Proc. Internat. Congress of Mathematicians, Vol. I, II (Kyoto 1990), 1455-1466, Math. Soc. Japan, Tokyo, 1991.
7. V. RÖDL and J. SKOKAN, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms 25 (2004), 1-42.
8. K. ROTH, On certain sets of integers, J. London Math. Soc. 28 (1953), 245-252.
9. I. Z. RUZSA and E. SZEMERÉDI, Triple systems with no six points carrying three triangles, in Combinatorics (Proc. Fifth Hungarian Colloq (Keszthely, 1976), Vol. II, 939-945.
10. I. D. SHKREDOV, On a problem of Gowers, (Russian) Izv. Ross. Akad. Nauk Ser. Mat. 70 (2006), 179-221;
11. translation in Izv. Math. 70 (2006), 385-425.
12. J. SOLYMOSI, Note on a generalization of Roth's theorem, Discrete and Computational Geom., 825-827, Algorithms Combin. 25, Springer-Verlag, New York, 2003.
13. _, A note on a question of Erdos and Graham, Combin. Probab. Comput. 13 (2004), 263-267.
14. E. SZEMERÉDI, Integer sets containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299-345.
15. _, Regular partitions of graphs, in Problèmes Combinatoires et Théorie des Graphes, Proc. Colloque Inter. CNRS, (Bermond, Fournier, Las Vergnas, Sotteau, eds.), CNRS Paris, 1978, 399-401.
16. T. TAO, A variant of the hypergraph removal lemma, J. Combin. Theory Ser. A 113 (2006), 1257-1280.