Sandwiching random graphs: Universality between random graph models

Advances in Mathematics

Volumn 188, Issue 2, 2004, Pages 444-469

  Kim, Je H ^a   Vu, Van H ^b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Random graphs; Universality

Indexed keywords

EID: 4444268591     PISSN: 00018708     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.aim.2003.10.007     Document Type: Article

References (27)

1. Alon N. Spencer J. The Probabilistic Method 1992 Wiley New York
2. Bender E. Canfield R. The asymptotic number of labeled graphs with given degree sequences J. Combin. Theory Ser. A 24 1978 296-307
3. Bollobás B. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs European J. Combin. 1 1980 311-316
4. Bollobás B. Random Graphs 1985 Academic Press New York
5. Bollobás B. The chromatic number of random graphs Combinatorica 8 1 1988 49-55
6. Cooper C. Frieze A. Reed B. Random regular graphs of non-constant degree: Connectivity and Hamiltonicity Combin. Probab. Comput. 11 3 2002 249-261
7. Cooper C. Frieze A. Reed B. Riordan O. Random regular graphs of non-constant degree: Independence and chromatic number Combin. Probab. Comput. 11 4 2002 323-341
8. Erdos P. Rényi A. On random graphs I Publ. Math. Debrecen 6 1959 290-297
9. Frieze A. Finding Hamiltonian cycles in spare random graphs J. Combinatorial Theory, Ser. B 44 1988 230-250
10. Haxell P. Kohayakawa Y. Łuzak T. T. Turan's extremal problem in random graphs: Forbidding even cycles J. Combin. Theory Ser. B 64 2 1995 273-287
11. Haxell P. Kohayakawa Y. Łuzak T. T. Turan's extremal problem in random graphs: Forbidding odd cycles Combinatorica 16 1 1996 107-122
12. S. Janson, T. LŁuczak, A. Ruciński, An exponential bound for the probability of nonexistence of a specified subgraph in a random graph, in: Random Graphs '87, Poznań, 1987, Wiley, Chichester, 1990, pp. 73-87
13. Janson S. Łuzak T. Ruciński A. Random Graphs 2000 Wiley New York, London
14. J.H. Kim, Perfect Matchings in Random Uniform Hypergraphs, to appear
15. Kim J.H. Sudakov B. Vu V.H. On the asymmetry of random graphs and random regular graphs Random Structures Algorithms 21 3-4 2002 216-224
16. Kim J.H. Vu V.H. Concentration of multi-variate polynomials and its applications Combinatorica 20 2000 417-434
17. J.H. Kim, V.H. Vu, Generating random regular graphs, Proceeding of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, (STOC 2002), pp. 213-222
18. J. Komlós, E. Szemerédi, Hamilton cycles in random graphs. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. II, pp. 1003-1010, Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975
19. Krivelevich M. Sudakov B. Vu V.H. Wormald N. Random regular graphs of high degree Random Structures Algorithms 18 4 2001 346-363
20. Łuzak T. The chromatic number of random graphs Combinatorica 11 1 1991 45-54
21. 1/2) Combinatorica 11 1991 369-382
22. Robinson R.W. Wormald N.C. Almost all regular graphs are hamiltonian Random Structures Algorithms 5 1994 363-374
23. Steger A. Wormald N. Generating random regular graphs quickly Combin. Probab. Comput. 8 4 1999 377-396
24. B. Sudakov, V.H. Vu, The tolerance of graphs, manuscript
25. Vu V.H. Concentration of non-Lipschitz functions and applications Random Structures Algorithms 20 2002 262-316
26. Wormald N.C. The asymptotic connectivity of labelled regular graphs J. Combin. Theory, Ser. B 31 1881 156-167
27. N.C. Wormald, Models of random regular graphs, in: J.D. Lamb, D.A. Preece (Eds.), Surveys in Combinatorics, Math. Society Lecture Notes Series, Vol. 267, Cambridge Univ. Press, Cambridge, 1999, pp. 239-298