Hereditary properties of triple systems

Combinatorics Probability and Computing

Volumn 12, Issue 2, 2003, Pages 155-189

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

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF NEVADA   (United States)

^c EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; THEOREM PROVING;

HYPERGRAPHS;

GRAPH THEORY;

EID: 0037996209     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548302005503     Document Type: Article

References (23)

1. Alekseev, V. E. (1993) On the entropy values of hereditary classes of graphs. Discrete Math. Appl. 3 191-199.
2. Bollobás, B. (1986) Combinatorics, Cambridge University Press, Cambridge.
3. Bollobás, B. and Thomason, A. (1995) Projections of bodies and hereditary properties of hypergraphs. Bull. London Math. Soc. 27 417-424.
4. Bollobás, B. and Thomason, A. (1997) Hereditary and monotone properties of graphs. In The Mathematics of Paul Erdos, II, Springer, Berlin, pp. 70-78.
5. Bollobás, B. and Thomason, A. (2000) The structure of hereditary properties and colourings of random graphs. Combinatorica 20 173-202.
6. Erdos, P. (1964) On extremal problems of graphs and generalized graphs. Israel J. Math. 2 183-190.
7. 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.
8. n-free graphs. In Colloquio Internazionale sulle Teorie Combinatorie: Rome, 1973, Tomo II, Accad. Naz. Lincei, Rome, pp. 19-27.
9. Erdos, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 1087-1091.
10. Frankl, P. and Rödl, V. (1984) Hypergraphs do not jump. Combinatorica 4 149-159.
11. Frankl, P. and Rödl, V. (2002) Extremal problems on set systems. Random Struct. Alg. 20 131-164.
12. Katona, G., Nemetz, T. and Simonovits, M. (1964) On a problem of Turán in the theory of graphs. Mat. Lapok 15 228-238.
13. Komlós, J. and Simonovits, M. (1996) Szemerédi's Regularity Lemma and its applications in graph theory. In Combinatorics: Paul Erdos is Eighty (Keszthely, 1993), Vol. 2, János Bolyai Math. Soc., Budapest, pp. 295-352.
14. Loomis, L. H. and Whitney, H. (1949) An inequality related to the isoperimetric inequality. Bull. Amer. Math. Soc. 55 961-962.
15. Nagle, B. and Rödl, V. (2001) The asymptotic number of triple systems not containing a fixed one. Discrete Math. 235 (2001), 271-290.
16. Nagle, B. and Rödl, V. (2002) Regularity properties for triple systems. Random Struct. Alg., to appear.
17. Prömel, H. J. and Steger, A. (1991) Excluding induced subgraphs: Quadrilaterals. Random Struct. Alg. 2 55-71.
18. Prömel, H. J. and Steger, A. (1992) The asymptotic number of graphs not containing a fixed color-critical subgraph. Combinatorica 12 463-473.
19. Prömel, H. J. and Steger, A. (1992) Excluding induced subgraphs III: A general asymptotic. Random Struct. Alg. 3 19-31.
20. Prömel, H. J. and Steger, A. (1993) The asymptotic structure of H-free graphs. In Graph Structure Theory (Seattle, WA, 1991), Vol. 147 of Contemp. Math., AMS, Providence, RI, pp. 167-178.
21. Rödl, V. and Ruciński, A. (1998) Ramsey properties of random hypergraphs. J. Combin. Theory Ser. A 81 1-33.
22. Scheinerman, E. R. and Zito, J. (1994) On the size of hereditary classes of graphs. J. Combin. Theory Ser. B 61 16-39.
23. Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes Combinatoires et Théorie des Graphes: Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976, CNRS, Paris, pp. 399-401.