Random trees and random graphs

Random Structures and Algorithms

Volumn 13, Issue 3-4, 1998, Pages 485-500

  Łuczak, Tomasz ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032221891     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199810/12)13:3/4<485::aid-rsa16>3.3.co;2-7     Document Type: Article

References (10)

1. K. B. Athreya and P. E. Ney, Branching Processes, Springer-Verlag, Berlin, 1972, pp. 287 + xi.
2. B. Bollobás, The evolution of random graphs, Trans. Amer. Math. Soc., 286, 257-274 (1984).
3. B. Bollobás, Random Graphs, Academic Press, London, 1985.
4. P. Erdös and A. Rényi, On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Into. Közl, 5, 17-61 (1960).
5. P. Flajolet, J. Gao, A. M. Odlyzko, and B. Richmond, The distribution of heights of binary trees and other simple trees, Combinatorics, Probab. Comput., 2, 145-156 (1993).
6. H. Kesten and B. Pittel, A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree, Random Structures Algorithms, 8, 243-299 (1996).
7. T. Łuczak, Component behaviour near the critical point of the random graph process, Random Structures Algorithms, 1, 287-310 (1990).
8. T. Łuczak, The number of trees with a large diameter, J. Austral. Math. Soc. Ser. A, 58, 298-311 (1995).
9. A. Rényi and G. Szekeres, On the height of trees, J. Austral. Math. Soc., 7, 497-507 (1967).
10. G. Szekeres, Distribution of labeled trees by diameter, in Combinatorial Mathematics X, Proceedings of the 10th Australian Conference, Adelaide, Australia, 1982, Lecture Notes in Math., 1983, Vol. 1036, pp. 392-397.