Regular partitions of hypergraphs: Regularity lemmas

Combinatorics Probability and Computing

Volumn 16, Issue 6, 2007, Pages 833-885

  Rödl, Vojtěch ^a   Schacht, Mathias ^b  

^a EMORY UNIVERSITY   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

HYPERGRAPHS; REGULARITY LEMMAS;

GRAPH THEORY;

EID: 35348964037     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008553     Document Type: Article

References (32)

1. Alon, N., Fischer, E., Krivelevich, M. and Szegedy, M. (2000) Efficient testing of large graphs. Combinatorica 20 451-476.
2. Avart, C., Rödl, V. and Schacht, M. Every monotone 3-graph property is testable. SIAM J. Discrete Math. 21(1) 73-92.
3. Cooley, O., Fountoulakis, N., Kühn, D. and Osthus, D. Embeddings and Ramsey numbers of sparse k-uniform hypergraphs. Submitted.
4. Erdos, P., Frankl, P. and Rödl, V. (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. Frankl, P. and Rödl, V. (2002) Extremal problems on set systems. Random Struct. Alg. 20 131-164.
6. Friedgut, E., Rödl, V., Ruciñski, A. and Tetali, P. (2006) A sharp threshold for random graphs with a monochromatic triangle in every edge coloring. Mem. Amer. Math. Soc. 179 845.
7. Furstenberg, H. and Katznelson, Y. (1978) An ergodic Szemerédi theorem for commuting transformations. J. Analyse Math. 34 275-291.
8. Furstenberg, H. and Katznelson, Y. (1985) An ergodic Szemerédi theorem for IP-systems and combinatorial theory. J. Analyse Math. 45 117-168.
9. Furstenberg, H. and Katznelson, Y. (1991) A density version of the Hales-Jewett theorem. J. Anal. Math. 57 64-119.
10. Gowers, W. T. Hypergraph regularity and the multidimensional Szemerédi theorem. Submitted.
11. Gowers, W. T. (1997) Lower bounds of tower type for Szemerédi's uniformity lemma. Geom. Funct. Anal. 7 322-337.
12. Gowers, W. T. (2006) Quasirandomness, counting and regularity for 3-uniform hypergraphs. Combin. Probab. Comput. 15 143-184.
13. Green, B. (2005) A Szemerédi-type regularity lemma in abelian groups, with applications. Geom. Funct. Anal. 15 340-376.
14. Green, B. and Tao, T. The primes contain arbitrarily long arithmetic progressions. Ann. of Math. (2), to appear.
15. Hales, A. W. and Jewett, R. I. (1963) Regularity and positional games. Trans. Amer. Math. Soc. 106 222-229.
16. Kohayakawa, Y. (1997) Szemerédi's regularity lemma for sparse graphs. In Foundations of Computational Mathematics: Rio de Janeiro 1997, Springer, Berlin, pp. 216-230.
17. Kohayakawa, Y., Rödl, V. and Skokan, J. (2002) Hypergraphs, quasi-randomness, and conditions for regularity. J. Combin. Theory Ser. A 97 307-352.
18. Komlós, J., Shokoufandeh, A., Simonovits, M. and Szemerédi, E. (2002) The regularity lemma and its applications in graph theory. In Theoretical Aspects of Computer Science: Tehran 2000, Vol. 2292 of Lecture Notes in Computer Science, Springer, Berlin, pp. 84-112.
19. Komlós, J. and Simonovits, M. (1996) Szemerédi's regularity lemma and its applications in graph theory. In Combinatorics: Paul Erdos is Eighty, Vol. 2 (Keszthely 1993), Vol. 2 of Bolyai Soc. Math. Stud., János Bolyai Math. Soc., Budapest, pp. 295-352.
20. Nagle, B., Rödl, V. and Schacht, M. (2006) The counting lemma for regular k-uniform hypergraphs. Random Struct. Alg. 28 113-179.
21. Nagle, B., Rödl, V. and Schacht, M. (2006) Extremal hypergraph problems and the regularity method. In Topics in Discrete Mathematics, Vol. 26 of Algorithms Combin., Springer, Berlin, pp. 247-278.
22. Nagle, B., Sayaka, O., Rödl, V. and Schacht, M. On the Ramsey number of sparse 3-graphs. Submitted.
23. Rödl, V. and Schacht, M. (2007) Regular partitions of hypergraphs: counting lemmas. Combin. Probab. Comput. 16(6): 887-901.
24. Rödl, V., Schacht, M., Siggers, M. and Tokushige, N. (2007) Integer and fractional packings of hypergraphs. J. Combin. Theory Ser. B 97 245-268.
25. Rödl, V., Schacht, M., Tengan, E. and Tokushige, N. (2006) Density theorems and extremal hypergraph problems. Israel J. Math. 152 371-380.
26. Rödl, V. and Skokan, J. (2004) Regularity lemma for k-uniform hypergraphs. Random Struct. Alg. 25 1-42.
27. Rödl, V. and Skokan, J. (2006) Applications of the regularity lemma for uniform hypergraphs. Random Struct. Alg. 28180-194.
28. Ruzsa, I. Z. and Szemerédi, E. (1978) Triple systems with no six points carrying three triangles. In Combinatorics: Proc. Fifth Hungarian Colloq, Vol. II (Keszthely 1976), Vol. 18 of Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, pp. 939-945.
29. Solymosi, J. (2004) A note on a question of Erdos and Graham. Combin. Probab. Comput. 13 263-267.
30. Szemerédi, E. (1975) On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 199-245.
31. Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes Combinatoires et Théorie des Graphes: Colloq. Internat. CNRS, Univ. Orsay, Orsay 1976, Vol. 260 of Colloq. Internat. CNRS, CNRS, Paris, pp. 399-401.
32. Tao, T. (2006) A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113 1257-1280.