2-Factors in Random Regular Graphs

Journal of Graph Theory

Volumn 23, Issue 3, 1996, Pages 215-224

  Robalewska, Hanna D ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030497019     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199611)23:3<215::AID-JGT1>3.0.CO;2-V     Document Type: Article

References (12)

1. E. A. Bender, Asymptotic methods in enumeration, SIAM Rev. 16 (1974), 485-515.
2. E. A. Bender and E. R. Canfield, The asymptotic number of labeled graphs with given degree sequences, J. Combin. Theory Ser. A 24 (1978), 296-307.
3. B. Bollobás and B. D. McKay, The number of matchings in random regular graphs and bipartite graphs, J. Combin. Theory Ser. B 41 (1986), 80-91.
4. W. Feller, An Introduction to Probability Theory and Its Applications. Vol. I. Wiley, New York, (1960).
5. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, Combinatorics, Probability and Computing, in press.
6. M. Molloy, H. Robalewska-Szarlat, R. W. Robinson, and N. C. Wormald, I-factorization of random regular graphs. Random Structures and Algorithms, submitted.
7. J. Petersen. Die Theorie der Regulären Graphen, Acta Mathematica 15 (1889), 193-220.
8. 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 Press Toronto (1984), 251-270.
9. R. W. Robinson and N. C. Wormald, Almost all cubic graphs are hamiltonian, Random Structures and Algorithms 3 (1992), 117-125.
10. R. W. Robinson and N. C. Wormald, Almost all regular graphs are hamiltonian, Random Structures and Algorithms 5 (1994), 363-374.
11. H. W. Wilf, Generatingfunctionology, Academic Press, New York (1990).
12. N. C. Wormald, The asymptotic distribution of short cycles in random regular graphs, J. Combin. Theory Ser. B 31 (1981), 168-182.