Regular partitions of hypergraphs: Counting lemmas

Combinatorics Probability and Computing

Volumn 16, Issue 6, 2007, Pages 887-901

  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

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; PROBABILITY DISTRIBUTIONS;

HYPERGRAPHS; REGULARITY LEMMAS;

GRAPH THEORY;

EID: 35348951983     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S0963548307008565     Document Type: Article

References (15)

1. Avart, C., Rödl, V. and Schacht, M. Every monotone 3-graph property is testable. SIAM J. Discrete Math. 21(1) 73-92.
2. Cooley, O., Fountoulakis, N., Kühn, D. and Osthus, D. Embeddings and Ramsey numbers of sparse k-uniform hypergraphs. Submitted.
3. 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.
4. Frankl, P. and Rödl, V. (2002) Extremal problems on set systems. Random Struct. Alg. 20 131-164.
5. Gowers, W. T. Hypergraph regularity and the multidimensional Szemerédi theorem. Submitted.
6. Kohayakawa, Y., Rödl, V. and Skokan, J. (2002) Hypergraphs, quasi-randomness, and conditions for regularity. J. Combin. Theory Ser. A 97 307-352.
7. 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.
8. Nagle, B., Rödl, V. and Schacht, M. (2006) The counting lemma for regular k-uniform hypergraphs. Random Struct. Alg. 28 113-179.
9. 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.
10. Nagle, B., Sayaka, O., Rödl, V. and Schacht, M. On the Ramsey number of sparse 3-graphs. Submitted.
11. Rödl, V. and Schacht, M. (2007) Regular partitions of hypergraphs: regularity lemmas. Combin Probab. Comput. 16(6): 833-885.
12. 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.
13. Rödl, V. and Skokan, J. (2004) Regularity lemma for k-uniform hypergraphs. Random Struct. Alg. 25 1-42.
14. Rödl, V. and Skokan, J. (2006) Applications of the regularity lemma for uniform hypergraphs. Random Struct. Alg. 28180-194.
15. Tao, T. (2006) A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113 1257-1280.