A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma

Journal d'Analyse Mathematique

Volumn 103, Issue 1, 2007, Pages 1-45

  Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 58449095860     PISSN: 00217670     EISSN: 15658538     Source Type: Journal    
DOI: 10.1007/s11854-008-0001-0     Document Type: Article

References (34)

1. M. Ajtai E. Szemerédi 1974 Sets of lattice points that form no squares Studia Sci. Math. Hungar. 9 9 11
2. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, Proc. of FOCS, 2005, pp. 429-438.
3. F. Chung R. Graham 1990 Quasi-random hypergraphs Random Structures Algorithms 1 105 124
4. P. Erdös P. Frankl V. Rödl 1986 The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent Graphs Combin. 2 113 121
5. P. Frankl V. Rödl 1992 The uniformity lemma for hypergraphs Graphs Combin. 8 309 312
6. P. Frankl V. Rödl 2002 Extremal problems on set systems Random Structures Algorithms 20 131 164
7. H. Furstenberg 1977 Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions J. Analyse Math. 31 204 256
8. H. Furstenberg, Recurrence in Ergodic theory and Combinatorial Number Theory, Princeton University Press, Princeton, NJ, 1981.
9. H. Furstenberg Y. Katznelson 1978 An ergodic Szemerédi theorem for commuting transformations J. Analyse Math. 34 275 291
10. H. Furstenberg Y. Katznelson D. Ornstein 1982 The ergodic theoretical proof of Szemerédi's theorem Bull. Amer. Math. Soc. 7 527 552
11. J-Y. Girard, Herbrand's theorem and proof theory, Proceedings of the Herbrand Symposium (Marseilles, 1981), North-Holland, Amsterdam, 1982, pp. 29-38.
12. T. Gowers 2006 Quasirandomness, counting and regularity for 3-uniform hypergraphs Combin. Probab. Comput. 15 143 184
13. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, preprint. See also arXiv:0710.3032
14. B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Ann. of Math., to appear. See also arXiv:math/0404188
15. B. Host, Progressions arithmétiques dans les nombres premiers (d'aprés B. Green and T. Tao), Séminaire Bourbaki, Mars 2005, 57eme année, 2004-2005, no. 944.
16. B. Host B. Kra 2005 Nonconventional ergodic averages and nilmanifolds Ann. of Math. (2) 161 397 488
17. J. Komlós and M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, Paul Erdos is Eighty, Vol. 2 (Keszthely, 1993), János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
18. B. Kra 2006 The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view Bull. Amer. Math. Soc. (N.S.) 43 3 23
19. L. Lovász B. Szegedy 2006 Limits of dense graph sequences J. Combin. Theory Ser. B 96 933 957
20. B. Nagle V. Rödl M. Schacht 2006 The counting lemma for regular k-uniform hypergraphs Random Structures Algorithms 28 113 179
21. V. Rödl M. Schacht 2007 Regular partitions of hypergraphs: Counting Lemmas Combin. Probab. Comput. 16 887 901
22. V. Rödl M. Schacht E. Tengan N. Tokushige 2006 Density theorems and extremal hypergraph problems Israel J. Math. 152 371 380
23. V. Rödl J. Skokan 2004 Regularity lemma for k-uniform hypergraphs Random Structures Algorithms 25 1 42
24. V. Rödl J. Skokan 2006 Applications of the regularity lemma for uniform hypergraphs Random Structures Algorithms 28 180 194
25. I. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol II, North-Holland, Amsterdam-New York, 1978, pp. 939-945.
26. J. Solymosi, Note on a generalization of Roth's theorem, Discrete and Computational Geometry, Springer, Berlin, 2003, pp. 825-827.
27. E. Szemerédi 1969 On sets of integers containing no four elements in arithmetic progression Acta Math. Acad. Sci. Hungar. 20 89 104
28. E. Szemerédi, Regular partitions of graphs, Problémes Combinatoires et Théorie des Graphes, (Colloq. Internat. CNRS, Univ. Orsay, 1976), CNRS, Paris, 1978, pp. 399-401.
29. T. Tao 2006 Szemerédi's regularity lemma revisited Contrib. Discrete Math. 1 8 28
30. T. Tao, A quantitative ergodic theory proof of Szemerédi's theorem, Electron. J. Combin. 13 (2006) #R 99.
31. T. Tao 2006 A variant of the hypergraph removal lemma J. Combin. Theory Ser. A 113 1257 1280
32. T. Tao 2006 The Gaussian primes contain arbitrarily shaped constellations J. Analyse Math. 99 109 176
33. T. Tao, An ergodic transference theorem, unpublished.
34. P. Varnavides 1959 On certain sets of positive density J. London Math. Soc. 34 358 360