Applications of the regularity lemma for uniform hypergraphs

Random Structures and Algorithms

Volumn 28, Issue 2, 2006, Pages 180-194

  Rödl, Vojtěch ^a   Skokan, Jozef ^b,c  

^a EMORY UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Applications; Hypergraph; Regularity lemma

Indexed keywords

EID: 33644942504     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20108     Document Type: Review

References (31)

1. W. G. Brown, P. Erdos, and V. T. Sós, Some extremal problems on r-graphs, New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971), Academic Press, New York, 1973, pp. 53-63.
2. G. Elekes, oral communication.
3. P. Erdos, P. Frankl, and V. Rödl, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin 2 (1986), 113-121.
4. P. Erdos, On extremal problems of graphs and generalized graphs, Isr J Math 2 (1964), 183-190.
5. P. Erdos, J. Nešetřil, and V. Rödl, On Pisier type problems and results (combinatorial applications to number theory), Mathematics of Ramsey theory, Algorithms Combin., Vol. 5, Springer-Verlag, Berlin, 1990, pp. 214-231.
6. P. Erdos and M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica 3 (1983), 181-192.
7. P. Erdos and A. H. Stone, On the structure of linear graphs, Bull Am Math Soc 52 (1946), 1087-1091.
8. P. Erdos and P. Turán, On some sequences of integers, J London Math Soc 11 (1936), 261-264.
9. P. Frankl and V. Rödl, Extremal problems on set systems, Random Struct Algo 20 (2002), 131-164.
10. Z. Füredi, oral communication.
11. W. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, submitted.
12. J. Komlós, A. Shokoufandeh, M. Simonovits, and E. Szemerédi, The regularity lemma and its applications in graph theory, Theoretical aspects of computer science (Tehran, 2000), Lecture Notes in Computer Science, Vol. 2292, Springer-Verlag, Berlin, 2002, pp. 84-112.
13. 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) (D. Miklós, V. T. Sós, and T. Szonyi, Eds.), Bolyai Society Mathematical Studies, Vol. 2, János Bolyai Mathematical Society, Budapest, 1996, pp. 295-352.
14. J. Matoušek, Lectures on discrete geometry. Graduate Texts in Mathematics, Vol. 212, Springer-Verlag, Berlin, 2002, xvi+481 pp.
15. B. Nagle and V. Rödl, Regularity properties for triple systems, Random Struct Algor 23 (2003), 264-332.
16. B. Nagle, V. Rödl, and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Struct Algor (2005), to appear.
17. B. Nagle, V. Rödl. and M. Schact, Extremal hypergraph problems and the regularity method, submitted, 2005.
18. V. Rödl, Some developments in Ramsey theory, Proceedings of the International Congress of Mathematicians, Vol. I, II (Kyoto, 1990), Math. Soc. Japan. Springer-Verlag, Tokyo, 1991, pp. 1455-1466.
19. V. Rödl and M. Schacht, Regular partitions of hypergraphs, submitted, 2005.
20. V. Rödl, M. Schacht, M. Siggers, and N. Tokushige, Packings of hypergraphs, submitted, 2005.
21. V. Rödl, M. Schacht, E. Tengan, and N. Tokushige, Density theorems and the regularity method, Isr J Math (2005), to appear.
22. V. Rödl and J. Skokan, Regularity lemma for uniform hypergraphs, Random Struct Algor 25 (2004), 1-42.
23. V. Rödl and J. Skokan, Counting subgraphs in quasi-random 4-uniform hypergraphs, Random Struct Algor 26 (2005). 160-203.
24. I. Z. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, Colloq. Math. Soc. János Bolyai, Vol. 18, North-Holland, Amsterdam, 1978, pp. 939-945.
25. M. Schacht, On the regularity method for hypergraphs, Ph.D. thesis, Emory University, 2004.
26. J. Solymosi, Note on a question of Erdos and Graham, Combin Probabil Comput 13 (2004), 263-267.
27. V. T. Sós, P. Erdos, and W. G. Brown, On the existence of triangulated spheres in 3-graphs, and related problems. Period Math Hungar 3 (1973), 221-228.
28. L. Székely, oral communication, 1997.
29. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith 27 (1975), 199-245.
30. E. Szemerédi, Regular partitions of graphs, Problèmes Combinatoires et Théorie des Graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976) (Paris), Colloques Internationaux CNRS No. 260, 1978, pp. 399-401.
31. P. Turán, Eine Extremalaufgabe aus der Graphentheorie, Mat Fiz Lapok 48 (1941), 436-452, in Hungarian, with German summary.