On the Asymmetry of Random Regular Graphs and Random Graphs

Random Structures and Algorithms

Volumn 21, Issue 3-4, 2002, Pages 216-224

  Kim, Jeong Han ^a   Sudakov, Benny ^b   Vu, Van H ^c  

^a MICROSOFT RESEARCH   (United States)

^b PRINCETON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036439127     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10054     Document Type: Conference Paper

References (13)

1. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Isr J Math 100 (1997), 171-187.
2. N. Alon and J. Spencer, The probabilistic method, 2nd ed, Wiley, New York, 2000.
3. B. Bollobás, Random graphs, Academic, London, 1985.
4. B. Bollobás, The asymptotic number of unlabelled regular graphs, J Lond Math Soc 26 (1982), 201-206.
5. P. Erdo″s and A. Rényi, Asymmetric graphs, Acta Math Acad Sci Hung 14 (1963), 295-315.
6. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
7. J. H. Kim and V. H. Vu, Sandwiching random graphs, manuscript.
8. M. Krivelevich, B. Sudakov, V. Vu, and N. Wormald, Random regular graphs of high degree, Random Struct Alg 18 (2001), 346-363.
9. T. Łuczak, The automorphism group of random graphs with a given number of edges, Math Proc Camb Phil Soc 104 (1988), 441-449.
10. B. D. McKay and N. C. Wormald, Automorphisms of random graphs with specified degrees, Combinatorica 4 (1984), 325-338.
11. B. D. McKay and N. C. Wormald, Uniform generation of random regular graphs of moderate degree, J Alg 11 (1991), 52-67.
12. E. Shamir and E. Upfal, "Large regular factors in random graphs," Convexity and graph theory (Jerusalem 1981), North Holland Math Stud 87, North Holland, Amsterdam 1984, pp. 271-282.
13. N. C. Wormald, "Models of random regular graphs," Eds. J. D. Lamb and D. A. Preece, Surveys in combinatorics, Cambridge Univ Press, Cambridge, 1999, pp. 239-298.