Regularity Lemma for k-uniform hypergraphs

Random Structures and Algorithms

Volumn 25, Issue 1, 2004, Pages 1-42

  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

Regular partition; Regularity lemma; Uniform hypergraphs

Indexed keywords

EID: 11144270528     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20017     Document Type: Article

References (15)

1. F. R. K. Chung, Regularity lemmas for hypergraphs and quasi-randomness, Random Structures Algorithms 2 (1991), 241-252.
2. A. Czygrinow and V. Rödl, An algorithmic regularity lemma for hypergraphs, SIAM J Comput 30(4) (2000), 1041-1066 (electronic).
3. P. Frankl and V. Rödl, The uniformity lemma for hypergraphs. Graphs Comhin 8(4) (1992), 309-312.
4. P. Frankl and V. Rodl, Extremal problems on set systems. Random Structures Algorithms 20(2) (2002), 131-164.
5. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica 19(2) (1999), 175-220.
6. W. T. Gowers, Hypergraph regularity and the multidimensional Szemeredi theorem, manuscript, (2003).
7. J. Komlós and M. Simonovits, "Szemerédi's regularity lemma and its applications in graph theory," Combinatorics - Paul Erdos is eighty, Volume 2 (Keszthely, 1993) Eds. D. Miklós, V. T. Sós, and T. Szonyi, Bolyai Society Mathematical Studies, Volume 2, 295-352. János Bolyai Mathematical Society, Budapest, 1996.
8. 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, Volume 2292, 84-112. Springer-Verlag, Berlin, 2002.
9. B. Nagle and V. Rödl, Regularity properties for triple systems, Random Structures Algorithms 23(3) (2003), 264-332.
10. B. Nagle, V. Rödl, and M. Schacht, The counting lemma for regular k-uniform hypergraphs, manuscript, (2003).
11. H. J. Prömel and A. Steger, Excluding induced subgraphs. III. A general asymptotic. Random Structures Algorithms 3(1) (1992), 19-31.
12. V. Rödl and J. Skokan, Counting subgraphs in quasi-random 4-uniform hypergraphs, submitted.
13. J. Skokan, Uniformity of set systems, Ph.D. thesis, Emory University, 2000 (available at http://www.mathcs.emory.edu/~rodl/grads.html).
14. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith 27 (1975), 199-245.
15. E. Szemerédi, Regular partitions of graphs, Problèmes combinatoires et théorie des graphes (Colloq Int CNRS, Univ Orsay, Orsay, 1976) (Paris), Colloques Internationaux CNRS 260, 1978, 399-401.