The structure of hereditary properties and colourings of random graphs

Combinatorica

Volumn 20, Issue 2, 2000, Pages 173-202

  Bollobás, Béla ^a,b   Thomason, Andrew ^c  

^a UNIVERSITY OF MEMPHIS   (United States)

^b TRINITY COLLEGE   (United Kingdom)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034361428     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930070019     Document Type: Article

References (18)

1. V. E. ALEKSEEV: Hereditary classes and coding of graphs, Probl. Cybern. 39 (1982), 151-164 (in Russian).
2. V. E. ALEKSEEV: On the entropy values of hereditary classes of graphs, Discrete Math. Appl. 3 (1993) 191-199.
3. B. BOLLOBÁS: Extremal Graph Theory, Academic Press (1978), xx + 488pp.
4. B. BOLLOBÁS: Random Graphs, Academic Press (1985), xvi + 447pp.
5. B. BOLLOBÁS: The chromatic number of random graphs, Combinatorica 8 (1988), 49-55.
6. B. BOLLOBÁS: Hereditary properties of graphs: asymptotic enumeration, global structure, and colouring, Proceedings of the International Congress of Mathematicians, Vol. III (Berlin, 1998). Doc. Math. 1998, 333-342.
7. B. BOLLOBÁS and A. THOMASON: Projections of bodies and hereditary properties of hypergraphs, J. London Math. Soc. 27 (1995), 417-424.
8. B. BOLLOBÁS and A. THOMASON: Hereditary and monotone properties of graphs, in "The Mathematics of Paul Erdös II" (R.L. Graham and J. Nešetřil, eds.) Algorithms and Combinatorics 14 Springer-Verlag (1997), 70-78.
9. B. BOLLOBÁS and A. THOMASON: Generalized chromatic numbers of random graphs, Random Structures and Algorithms 6 (1995), 353-356.
10. S. JANSON: Poisson approximation for large deviations, Random Structures and Algorithms 1 (1990), 221-229.
11. J. KOMLÓS and M. SIMONOVITS: Szemerédi's Regularity Lemma and its applications in graph theory, in: Combinatorics, Paul Erdös is Eighty (D. Miklós, V.T. Sós and T. Szöny, eds.), Bolyai Mathematical Society Studies, Vol. 2, János Bolyai Mathematical Society, Budapest (1996) 295-352.
12. C. J. H. McDIARMID: On the method of bounded differences, in: Surveys in Combinatorics, LMS Lecture Notes 141 (1989), 148-188.
13. H. J. PRÖMEL and A. STEGER: The asymptotic structure of H-free graphs, in: Graph Structure Theory (N. Robertson and P. Seymour, eds), Contemporary Mathematics 147, Amer. Math. Soc., Providence, 1993, 167-178.
14. E. R. SCHEINERMAN: Generalized chromatic numbers of random graphs, SIAM J. Discrete Math. 5 (1992), 74-80.
15. J. M. STEELE: Probability Theory and Combinatorial Optimization, CBMS-NSF Regional Conference Series in Applied Mathematics 69, SIAM (1997).
16. W. C. S. SUEN: A correlation inequality and a Poisson limit theorem for nonoverlapping balanced subgraphs of a random graph, Random Structures and Algorithms 1 (1990), 231-242.
17. E. SZEMERÉDI: Regular partitions of graphs, in: Proc. Colloque Inter. CNRS (J.-C. Bermond, J.-C. Fournier, M. las Vergnas, D. Sotteau, eds), (1978).
18. A. THOMASON: On finite ramsey numbers, European J. Combinatorics 3 (1982), 263-273.