Measures on monotone properties of graphs

Discrete Applied Mathematics

Volumn 116, Issue 1-2, 2002, Pages 17-36

  Balogh, Jòzsef ^a   Bollobás, Béla ^a,b   Weinreich, David ^c  

^a University of Memphis   (United States)

^b TRINITY COLLEGE   (United Kingdom)

^c GETTYSBURG COLLEGE   (United States)

Author keywords

Extremal graph theory; Graph properties; Hereditary; Monotone; Size; Speed

Indexed keywords

EID: 84867957342     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00175-5     Document Type: Article

References (24)

1. V.E. Alekseev On the entropy values of hereditary classes of graphs Discrete Math. Appl. 3 1993 191 199
2. J. Balogh, B. Bollobás, and D. Weinreich The size of hereditary properties of graphs J. Combin. Theory B 79 2000 131 156
3. J. Balogh, B. Bollobás, and D. Weinreich The penultimate range of growth for graph properties European J. Combin. 22 2001 277 289 (Pubitemid 33649481)
4. J. Balogh, B. Bollobás, D. Weinreich, The structure of posets and an application to hereditary properties, preprint.
5. B. Bollobás, and A. Thomason Projections of bodies and hereditary properties of hypergraphs J. London Math. Soc. 27 1995 417 424
6. B. Bollobás, and A. Thomason Hereditary and monotone properties of graphs R.L. Graham, J. Nešetil, The mathematics of Paul Erdos II Algorithms and Combinatorics Vol. 14 1997 Springer Berlin 70 78 (Pubitemid 126155577)
7. B. Bollobás, and A. Thomason Generalized chromatic numbers of random graphs Random Structures Algorithms 6 1995 353 356
8. B. Bollobás, A. Thomason, Colouring random graphs by hereditary properties, to appear.
9. B. Bollobás, and P. Erdos On the structure of edge graphs Bull. London Math. Soc. 5 1973 317 321
10. P. Erdos, Some recent results on extremal problems in graph theory, Results, 1967 Theory of Graphs, International Symposium, ed. P. Rosenstiehl, Gordon & Breach, NY, Rome, 1966, pp. 117-123.
11. P. Erdos, On some new inequalities concerning extremal properties of graphs, 1968 Theory of Graphs, Proceedings Colloqium, Tihany, Academic Press, NY, 1966, pp. 77-81.
12. P. Erdos, P. Frankl, and V. Rödl The asymptotic enumeration of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent Graphs Combin. 2 1986 113 121
13. P. Erdos, and M. Simonovits On a valence problem in extremal graph theory Discrete Math. 5 1973 323 334
14. P. Erdos, M. Simonovits, Some extremal problems in graph theory, Combinatorial theory and its applications, Vol. I, Proceedings Colloqium, Balatonfured, 1969, North-Holland, Amsterdam, 1970, pp. 377-390.
15. P. Erdos, and M. Simonovits An extremal graph problem Acta Math. Acad. Sci. Hungar. 22 1971/72 275 282
16. P. Erdos, and M. Simonovits A limit theorem in graph theory Studia Sci. Math. Hungar. 1 1966 51 57
17. T. Kovári, V.T. Sós, and P. Turán On a problem of K. Zarankiewicz. Colloq. Math. 3 1954 50 57
18. H.J. Prömel, and A. Steger Excluding induced subgraphs: quadrilaterals Random Struct. Algorithms 2 1991 55 71
19. H.J. Prömel, and A. Steger Excluding induced subgraphs II: extremal graphs Discrete Appl. Math. 44 1993 283 294
20. H.J. Prömel, and A. Steger Excluding induced subgraphs III: a general asymptotic Random Struct. Algorithms 3 1992 19 31
21. H.J. Prömel, A. Steger, The asymptotic structure of H-free graphs, in: N. Robertson, P. Seymour (Eds.), Graph Structure Theory, Contemporary Mathematics, Vol. 147, Amer. Math. Soc., Providence, RI, 1993, pp. 167-178.
22. M. Simonovits, A method for solving extremal problems in graph theory, stability problems, 1968 Theory of Graphs, Proceedings Colloqium, Tihany, Academic Press, NY, 1966, pp. 279-319.
23. E.R. Scheinerman, and J. Zito On the size of hereditary classes ofgraphs J. Combin. Theory B 61 1994 16 39
24. E. Szemerédi, Regular partitions of graphs, in: J.-C. Bermond, J.-C. Fournier, M. las Vergnas, D. Sotteau (Eds.), Proceedings Colloque Inter. CNRS, 1978.