Regularity Properties for Triple Systems

Random Structures and Algorithms

Volumn 23, Issue 3, 2003, Pages 264-332

  Nagle, Brendan ^a   Rödl, Vojtěch ^b  

^a UNIVERSITY OF NEVADA   (United States)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (12)

1. 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.
2. P. Frankl and V. Rödl, Extremal problems on set systems, Random Structures Algorithms 20(2) (2002), 131-164.
3. P. Haxell, B. Nagle, and V. Rödl, Integer and fractional packings in dense 3-uniform hypergraphs, Random Structures Algorithms 22(3) (2003), 248-310.
4. Y. Kohayakawa, B. Nagle, and V. Rödl, Hereditary properties of triple systems, Combin Probab Comput 12(2) (2003), 155-189.
5. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory, Combinatorics 2 (1996), 295-352.
6. B. Nagle, Regularity properties for triple systems, Ph.D. Thesis, Emory University, Atlanta, GA, 1999.
7. B. Nagle and V. Rödl, The asymptotic number of triple systems not containing a fixed one, Discrete Math 235 (2001), 271-290.
8. Y. Peng, V. Rödl, and J. Skokan, Counting small cliques in 3-uniform hypergraphs, Combin Probab Comput, to appear.
9. V. Rödl and J. Skokan, Uniformity of set systems, submitted.
10. I. Z. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics, Vol. II, Colloq Math Soc J Bolyai 18, North-Holland, Amsterdam, 1978, pp. 939-945.
11. E. Szemerédi, Regular partitions of graphs, Proc Colloq Int CNRS (1976), pp. 399-401.
12. E. Szemerédi, On sets of integers containing no k elements in arithmic progression, Acta Arith 27 (1975), 199-245.