Random regular graphs of non-constant degree: Connectivity and Hamiltonicity

Combinatorics Probability and Computing

Volumn 11, Issue 3, 2002, Pages 249-261

  Cooper, Colin ^a   Frieze, Alan ^b   Reed, Bruce ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HAMILTONIANS; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; SET THEORY;

CONNECTIVITY; HAMILTONICITY; RANDOM REGULAR GRAPHS;

GRAPH THEORY;

EID: 0036016678     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548301005090     Document Type: Article

References (22)

1. Alon, N. and Spencer, J. (1992) The Probabilistic Method, Wiley.
2. Bender, E. A. and Canfield, E. R. (1978) The asymptotic number of labelled graphs with given degree sequences. J. Combin. Theory Ser. A 24 296-307.
3. Bollobás, B. (1980) A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Europ. J. Combin. 1 311-316.
4. Bollobás, B. (1981) Random graphs. In Combinatorics (H. N. V. Temperley, ed.), Vol. 52 of LMS Lecture Note Series, Cambridge University Press, Cambridge, 80-102.
5. Bollobás, B. (1983) Almost all regular graphs are Hamiltonian. Europ. J. Combin. 4 97-106.
6. Bollobás, B. (1985) Random Graphs, Academic Press.
7. Feller, W. (1960) An Introduction to Probability Theory, Vol. I, Wiley.
8. Fenner, T. I. and Frieze, A. M. (1984) Hamiltonian cycles in random regular graphs. J. Combin. Theory Ser. B 37 103-112.
9. Frieze, A. M. (1988) Random regular graphs of non-constant degree. Technical Report, Department of Mathematical Sciences, Carnegie Mellon University.
10. Frieze, A. M. (1988) Finding Hamilton cycles in sparse random graphs. J. Combin. Theory Ser. B 44 230-250.
11. Frieze, A. M. and Łuczak, T. (1992) On the independence and chromatic numbers of random regular graphs. J. Combin. Theory Ser. B 54 123-132.
12. Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley.
13. Krivelevich, M., Sudakov, B., Vu, V. and Wormald, N. C. Random regular graphs of high degree. To appear in Random Struct. Alg.
14. Kučera, L. (1987) Canonical labelling of regular graphs in linear expected time. In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, 271-279.
15. Łuczak, T. (1992) Sparse random graphs with a given degree sequence. In Random Graphs, Vol. 2 (A. M. Frieze and T. Ł, eds), Wiley, New York, 165-182.
16. McKay, B. D. (1985) Asymptotics for symmetric 0-1 matrices with prescribed row sums. Ars Combinatoria 19A 15-25.
17. 1/2). Combinatorica 11 369-382.
18. McKay, B. D. and Wormald, N. C. (1990) Asymptotic enumeration by degree sequence of graphs of high degree. Europ. J. Combin. 11 565-580.
19. Pósa, L. (1976) Hamilton circuits in random graphs. Discrete Math. 14 359-364.
20. Robinson, R. W. and Wormald, N. C. (1992) Almost all cubic graphs are Hamiltonian. Random Struct. Alg. 3 117-126.
21. Robinson, R. W. and Wormald, N. C. (1994) Almost all regular graphs are Hamiltonian. Random Struct. Alg. 5 363-374.
22. Wormald, N. C. (1999) Models of random regular graphs. In Surveys in Combinatories. Proceedings of the 1999 British Combinatorial Conference (J. D. Lamb and D. A. Preece, eds). Vol. 267 of LMS Lecture Note Series, Cambridge University Press, Cambridge, 239-298.