Random regular graphs of high degree

Random Structures and Algorithms

Volumn 18, Issue 4, 2001, Pages 346-363

  Krivelevich, Michael ^a   Sudakov, Benny ^b,c   Vu, Van H ^d   Wormald, Nicholas C ^e  

^a TEL AVIV UNIVERSITY   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d MICROSOFT RESEARCH   (United States)

^e NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035609582     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.1013     Document Type: Article

References (34)

1. N. Alon, Restricted colorings of graphs, in Surveys in combinatorics 1993, London Math. Soc. Lecture Notes Series 187 (K. Walker, ed.), Cambridge Univ. Press, Cambridge, UK, 1993, pp, 1-33.
2. N. Alon, M. Krivelevich, and B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica 19 (1999), 453-472.
3. N. Alon, M. Krivelevich, and B. Sudakov, Coloring graphs with sparse neighborhoods, J. Combinatorial Theory Ser. B 77 (1999), 73-82,
4. N. Alon and J. Spencer, The probabilistic method, Wiley, New York 1992.
5. P. Boldi and S. Vigna, More lower bounds for weak sense of direction: The case of regular graphs, manuscript.
6. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, Europ. J. Combinatorics 1 (1980), 311-316.
7. B. Bollobás, Random graphs, in Combinatorics (H.N.V. Temperley, ed.), London Mathematical Society Lecture Note Series 52, Cambridge Univ. Press, Cambridge, UK, 1981, pp. 80-102.
8. B. Bollobás, Random graphs, Academic Press, New York, 1985.
9. B. Bollobás, The chromatic number of random graphs, Combinatorica 8 (1988), 49-55.
10. B. Bollobás and P. Erdos, Cliques in random graphs, Math Proc Cambridge Phil Soc 80 (1976), 419-427.
11. B. Bollobás and A. Thomason, Random graphs of small order, in Random graphs '83, Proceedings, Poznań, 1983, (M. Karoński and A. Ruciński, eds.), Amsterdam/New York, 1985, p. 47-97.
12. V. Chvátal and P. Erdos, A note on Hamiltonian circuits, Discrete Math 2 (1972), 111-113.
13. C. Cooper, A. Frieze, and B. Reed, Random regular graphs of non-constant degree, manuscript.
14. P. Erdos and A. Rényi, On random graphs I, Publ Math Debrecen 6 (1959), 290-297.
15. A. Frieze, On the independence number of random graphs, Discrete Math 81 (1990), 171-175.
16. A. Frieze and T. Łuczak, On the independence and chromatic numbers of random regular graphs, J Combinatorial Theory Ser B, 54 (1992), 123-132.
17. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), 233-241.
18. R. Graham, M. Grötschel, and L. Lovász, (Eds.), Appendix of Chapter 31, Handbook of combinatorics, North-Holland, Amsterdam, 1995.
19. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
20. J. Komlós and E. Szemerédi, Limit distributions for the existence of Hamilton cycles in a random graph, Discrete Math 43 (1983), 55-63.
21. M. Krivelevich, The choice number of dense random graphs, Combinatorics Probab Comput 9 (2000), 19-26.
22. M. Krivelevich and V.H. Vu, Choosability in random hypergraphs, submitted.
23. T. Łuczak, The chromatic number of random graphs, Combinatorica 11 (1991), 45-54.
24. B.D. McKay and N.C. Wormald, Automorphisms of random graphs with specified degrees, Combinatorica 4 (1984), 325-338.
25. B.D. McKay and N.C. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree, Europ J Combinatorics 11 (1990), 565-580.
26. 1/2), Combinatorica 11 (1991), 369-382.
27. B.D. McKay and N.C. Wormald, Uniform generation of random regular graphs of moderate degree, J Algorithms 11 (1991), 52-67.
28. D. Matula, The largest clique size in a random graph, Tech. Rep. Dept. Comp. Sci., Southern Methodist University, Dallas, Texas, 1976.
29. R.W. Robinson and N.C. Wormald, Almost all cubic graphs are hamiltonian, Random Structures Algorithms 3 (1992), 117-125.
30. R.W. Robinson and N.C. Wormald, Almost all regular graphs are hamiltonian, Random Structures Algorithms 5 (1994), 363-374.
31. E. Shamir and E. Upfal, Large regular factors in random graphs, in Convexity and graph theory (Jerusalem 1981), North-Holland Math. Stud. 87, North-Holland, Amsterdam/New York, 1984, pp. 271-282.
32. V.H. Vu, On some degree conditions which guarantee the upper bound of chromatic (choice) number of random graphs, J Graph Theory 31 (1999), 201-226.
33. N.C. Wormald, The asymptotic connectivity of labelled regular graphs, J Combinatorial Theory Ser B 31 (1981), 156-167.
34. N.C. Wormald, Models of random regular graphs, in Surveys in combinatorics 1999, (J.D. Lamb and D.A. Preece, eds.), pp. 239-298.