The Maximum Degree of a Random Graph

Combinatorics Probability and Computing

Volumn 9, Issue 6, 2000, Pages 549-572

  Riordan, Oliver ^a   Selby, Alex ^b  

^a TRINITY COLLEGE   (United Kingdom)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034554585     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004491     Document Type: Article

References (9)

1. Bollobás, B. (1981) Degree sequences of random graphs. Discrete Math. 33 1-19.
2. Bollobás, B. (1985) Random Graphs, Academic Press, London/New York.
3. Bollobás, B. (1986) Combinatorics, Cambridge University Press, Cambridge/New York.
4. Courant, R. and Hubert, D. (1953) Methods of Mathematical Physics, Vol. I, Interscience Publishers, New York/London.
5. Erdos, P. and Rényi, A. (1959) On random graphs, I. Publ. Math. Debrecen 6 290-297.
6. Feller, W. (1971) An Introduction to Probability Theory and its Applications, Vol. II, 2nd edn, Wiley, New York/London/Sydney.
7. Grimmett, G. R. and Stirzaker, D. R. (1992) Probability and Random Processes, 2nd edn, Clarendon Press, Oxford/New York.
8. Kleitman, D. J. (1966) Families of non-disjoint subsets. J. Combin. Theory 1 153-155.
9. McKay, B. D. and Wormald, N. C. (1997) The degree sequence of a random graph, I: The models. Random Structures and Algorithms 11 97-118.