Density theorems and extremal hypergraph problems

Israel Journal of Mathematics

Volumn 152, Issue , 2006, Pages 371-380

  Rodl V ^a   Schacht, M ^b   Tengan, E ^a   Tokushige, N ^c  

^a EMORY UNIVERSITY   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c UNIVERSITY OF THE RYUKYUS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646394065     PISSN: 00212172     EISSN: 15658511     Source Type: Journal    
DOI: 10.1007/BF02771992     Document Type: Article

References (15)

1. P. Frankl and V. Rödl, Extremal problems on set systems, Random Structures & Algorithms 20 (2002), 131-164.
2. H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, Journal d'Analyse Mathématique 31 (1977), 204-256.
3. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, Journal d'Analyse Mathématique 34 (1978), 275-291.
4. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for IP-systems and combinatorial theory, Journal d'Analyse Mathématique 45 (1985), 117-168.
5. H. Furstenberg and Y. Katznelson, A density version of the Hales-Jewett theorem, Journal d'Analyse Mathématique 57 (1991), 64-119.
6. W. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, submitted.
7. W. T. Gowers, A new proof of Szemerédi's theorem, Geometric and Functional Analysis 11 (2001), 465-588.
8. A. W. Hales and R. I. Jewett, Regularity and positional games, Transactions of the American Mathematical Society 106 (1963), 222-229.
9. B. Nagle, V. Rödl and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures & Algorithms, to appear.
10. V. Rödl and J. Skokan, Applications of the regularity lemma for uniform hypergraphs, Random Structures & Algorithms, to appear.
11. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures & Algorithms 25 (2004), 1-42.
12. J. Solymosi, A note on a question of Erdos and Graham, Combinatorics, Probability and Computing 13 (2004), 263-267.
13. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), 199-245, Collection of articles in memory of Juriǐ Vladimirović Linnik.
14. E. Szemerédi, Regular partitions of graphs, in Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), CNRS, Paris, 1978, pp. 399-401.
15. T. Tao, A quantitative ergodic theory proof of Szemerédi's theorem, submitted.