Asymptotic enumeration, global structure, and constrained evolution

Discrete Mathematics

Volumn 229, Issue 1-3, 2001, Pages 213-233

  Prömel, Hans Jürgen ^a   Steger, Angelika ^b   Taraz, Anusch ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040340592     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00211-9     Document Type: Article

References (43)

1. V.E. Alekseev, On the entropy values of hereditary classes of graphs, Discrete Appl. Math. 3 (1993) 191-199.
2. B. Bollobás, Random Graphs, Academic Press, London, 1985.
3. B. Bollobás, Martingales, isoperimetric inequalities and random graphs, in: A. Hajnal, L. Lovász, V.T. Sós (Eds.), Combinatorics, North-Holland, Amsterdam, 1988, pp. 113-139.
4. B. Bollobás, Hereditary properties of graphs: asymptotic enumeration, global structure, and colouring, in: Documenta Mathematica, Vol. 3, ICM, 1998, pp. 333-342.
5. B. Bollobás, A. Thomason, Hereditary and monotone properties of graphs, in: R.L. Graham, J. Nešetřil (Eds.), The mathematics of Paul Erdos II, Algorithms and Combinatorics, Vol. 14, Springer, Berlin,
6. G. Brightwell, H.J. Prömel, A. Steger, The average number of linear extensions of a partial order, J. Combin. Theory Ser A 73 (1996) 193-206.
7. D. Dhar, Entropy and phase transitions in partially ordered sets, J. Math. Phys. 19 (1978) 1711-1713.
8. D. Dhar, Asymptotic enumeration of partially ordered sets, Pacific J. Math. 90 (1980) 299-305.
9. P. Erdos, Some remarks on the theory of graphs, Bull. Austral. Math. Soc. 53 (1947) 292-294.
10. P. Erdos, P. Frankl, 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.
11. n-free graphs, in: International Colloquium on Combinatorial theory, Atti dei Convegni Lincei 17, Rome, Vol. 2, 1976, pp. 19-27.
12. P. Erdos, A. Rényi, On random graphs I, Publ. Math. Debrecen 6 (1959) 290-297.
13. P. Erdos, A. Rényi, On the evolution of random graphs, Publ. Math. Inst. Hungar. Acad. Sci. 5 (1961) 17-61.
14. P. Erdos, A. Rényi, On the evolution of random graphs, Bull. Inst. Internat. Statist. 38 (4) (1961) 343-347.
15. P. Erdos, A. Rényi, On the strength of connectedness of a random graph, Acad. Sci. Hungar. 12 (1961) 261-267.
16. P. Erdos, A. Rényi, On random matrices, Magyar Tud. Akad. Mat. Kutató Int. Közl. 8 (1964) 455-461.
17. P. Erdos, A. Rényi, On random matrices II, Studia Sci. Math. Hungar. 3 (1968) 459-464.
18. P. Erdos, M. Simonovits, A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966) 51-57.
19. P. Erdos, A.H. Stone, On the structure of linear graphs, Bull. Amer. Math. Soc. 5 (1946) 1089-1091.
20. S. Janson, T. Łuczak, A. Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, in: M. Karoński, J. Jaworski, A. Ruciński (Eds.), Random Graphs '87, Wiley, Chichester, 1990, pp. 73-87.
21. M. Karoński, Random Graphs, Handbook of Combinatorics, Vol. 1, North-Holland, Amsterdam, 1995, pp. 351-380.
22. D.J. Kleitman, B.L. Rothschild, The number of finite topologies, Proc. Amer. Math. Soc. 25 (1970) 276-282.
23. D.J. Kleitman, B.L. Rothschild, Asymptotic enumeration of partial orders on a finite set, Trans. Amer. Math. Soc. 205 (1975) 205-220.
24. D.J. Kleitman, B.L. Rothschild, A phase transition on partial orders, Physica A 96 (1979) 254-259.
25. D.J. Kleitman, D.B. Wilson, On the number of graphs which lack small cycles, preprint, 1997.
26. I+⊥-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303 (1987) 637-671.
27. B. Kreuter, Extremale und Asymptotische Graphentheorie für verbotene bipartite Untergraphen, Diplomarbeit, Universität Bonn, 1994.
28. E. Lamken, B.L. Rothschild, The number of odd-cycle-free graphs, in: A. Hajnal, L. Lovász, V.T. Sós (Eds.), Finite and Infinite Sets, Colloq. Math. Soc. János Bolyai, Vol. 37, North-Holland, Amsterdam, 1984, pp. 547-553.
29. T. Łuczak, On triangle-free random graphs, Random Struct. Algorithms 16 (2000) 260-276.
30. H.J. Prömel, A. Steger, Excluding induced subgraphs III: a general asymptotic, Random Struct. Algorithms 3 (1992) 19-31.
31. H.J. Prömel, A. Steger, The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica 12 (1992) 463-473.
32. H.J. Prömel, A. Steger, Excluding induced subgraphs II: extremal graphs, Discrete Appl. Math. 44 (1993) 283-294.
33. H.J. Prömel, A. Steger, Random l-colorable graphs, Random Struct. Algorithms 6 (1995) 21-37.
34. H.J. Prömel, A. Steger, Counting H-free graphs, Discrete Math. 154 (1996) 311-315.
35. H.J. Prömel, A. Steger, On the asymptotic structure of sparse triangle-free graphs, J. Graph Theory 21 (1996) 137-151.
36. H.J. Prömel, A. Steger, A. Taraz, Phase transitions in the evolution of partial orders, J. Combin. Theory Ser A, to appear.
37. H.J. Prömel, A. Steger, A. Taraz, Counting partial orders with a fixed number of comparable pairs, Combin. Probab. Comput., to appear.
38. E.R. Scheinerman, J. Zito, On the size of hereditary classes of graphs, J. Combin. Theory (B) (1994) 16-39.
39. A. Steger, Asymptotic Properties of H-Free Graphs, Habilitationsschrift, Universität Bonn, 1993.
40. W.T. Trotter, Applications of the probabilistic method to partially ordered sets, in: R.L. Graham, J. Nešetřil (Eds.), The Mathematics of Paul Erdos II, Algorithms and Combinatorics, Vol. 14, Springer, Berlin, 1997, pp. 214-228.
41. P. Turán, Egy gráfelméleti széloértékfeladatról, Mat. Fiz. Lapok 48 (1941) 436-452.
42. P. Turán, On the theory of graphs, Colloq. Math. 3 (1954) 19-30.
43. P. Winkler, Random structures and 0-1 laws, in: N.W. Sauer, R.E. Woodrow, B. Sands (Eds.), Finite and Infinite Combinatorics of Sets and Logic, NATO ASI Series, Kluwer Academic Publishers, Dordrecht, 1991.