The degree sequence of a random graph. I. The models

Random Structures and Algorithms

Volumn 11, Issue 2, 1997, Pages 97-117

  McKay, Brendan D ^a   Wormald, Nicholas C ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031475726     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199709)11:2<97::AID-RSA1>3.0.CO;2-O     Document Type: Article

References (9)

1. A. D. Barbour, L. Holst, and S. Janson, Poisson Approximation, Clarendon, Oxford, 1992.
2. B. Bollobàs, Random Graphs, Academic, London, 1985.
3. W. Feller, An Introduction to Probability Theory and Its Applications, Wiley, New York, 1966, Vol. II.
4. B. D. McKay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree, Eur. J. Combinat., 11, 565-580 (1990).
5. 1/2), Combinatorica, 11, 369-382 (1991).
6. B. D. McKay and N. C. Wormald, The degree sequence of a random graph. II. Applications, in preparation.
7. Z. Palka, Asymptotic properties of random graphs, Dissertationes mathematicae CCLXXV, Polska Akademia Nauk, Instytut Matematyczny, Warsaw, 1988.
8. W. Rudin, Real and Complex Analysis, McGraw-Hill, New York, 1986.
9. n, p, Combinatorica, 7, 121-129 (1987).