1-factorizations of random regular graphs

Random Structures and Algorithms

Volumn 10, Issue 3, 1997, Pages 305-321

  Molloy, M S O ^a   Robalewska, H ^b   Robinson, R W ^c   Wormald, N C ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c University of Georgia   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031510220     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199705)10:3<305::aid-rsa1>3.0.co;2-%23     Document Type: Article

References (14)

1. E. A. Bender, The asymptotic number of non-negative integer matrices with given row and column sums, Discrete Math., 10, 217-223 (1974).
2. E. A. Bender and E. R. Canfield, The asymptotic number of labeled graphs with given degree sequences, J. Combinat. Theor. Ser. A, 24, 296-307 (1978).
3. B. Bollobás and B. D. McKay, The number of matchings in random regular graphs and bipartite graphs, J. Combinat. Theor. Ser. B. 41, 80-91 (1986).
4. C. Cooper, A note on the connectivity of 2-regular digraphs, Random Struct. Alg., 4, 469-472 (1993).
5. C. Cooper, A. Frieze, and M. Molloy, Hamilton cycles in random regular digraphs, Combinat. Probab. Comput., 3, 39-50 (1994).
6. A. Frieze, M. Jerrum, M. Molloy, R. W. Robinson, and N. C. Wormald, Generating and counting hamilton cycles in random regular graphs, J. Alg., 21, 176-198 (1996).
7. S. Janson, Random regular graphs: asymptotic distributions and contiguity, Combinat. Probab. Comput., to appear.
8. L. Le Cam, Locally asymptotically normal families of distributions, Univ. Calif. Publ. Stat., 3, 37-98 (1960).
9. M. Molloy and B. Reed, The dominating number of a random cubic graph, Random Struct. Alg., 7, 209-221 (1995).
10. H. Robalewska, 2-factors in random regular graphs, J. Graph., Theor., 23, 215-224 (1996).
11. R. W. Robinson and N. C. Wormald, Existence of long cycles in random cubic graphs, in Enumeration and Design, D. M. Jackson and S. A. Vanstone, Eds., Academic, Toronto, 1984, pp. 251-270.
12. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are hamiltonian, Random Struct. Alg., 3, 117-125 (1992).
13. R. W. Robinson and N. C. Wormald, Almost all regular graphs are hamiltonian, Random Struct. Alg., 5, 363-374 (1994).
14. G. Roussas, Contiguity of Probability Measures: Some Applications in Statistics, Cambridge University Press, Cambridge, 1972.