Sandwiching random graphs : universality between random graph models

@inproceedings{Kima2002SandwichingRG,
  title={Sandwiching random graphs : universality between random graph models},
  author={J. H. Kima},
  year={2002}
}
  • J. H. Kima
  • Published 2002
The goal of this paper is to establish a connection between two classical models of random graphs: the random graph Gðn; pÞ and the random regular graph GdðnÞ: This connection appears to be very useful in deriving properties of one model from the other and explains why many graph invariants are universal. In particular, one obtains one-line proofs of several highly non-trivial and recent results on GdðnÞ: r 2003 Elsevier Inc. All rights reserved. MSC: 05C80; 60C05; 74H50 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Meyniel's conjecture holds for random graphs

Random Struct. Algorithms • 2016
View 5 Excerpts
Highly Influenced

On the Game Chromatic Number of Sparse Random Graphs

SIAM J. Discrete Math. • 2013
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Random regular graphs of high degree

Random Struct. Algorithms • 2001
View 4 Excerpts
Highly Influenced

Generating Random Regular Graphs Quickly

Combinatorics, Probability & Computing • 1999
View 10 Excerpts
Highly Influenced

Almost All Regular Graphs Are Hamiltonian

Random Struct. Algorithms • 1994
View 13 Excerpts
Highly Influenced

N

B. McKay
Wormald, Asymptotic enumeration by degree sequence of graphs with degrees oðnÞ; Combinatorica 11 • 1991
View 13 Excerpts
Highly Influenced

Concentration of non-Lipschitz functions and applications

Random Struct. Algorithms • 2002
View 1 Excerpt

Random Graphs

S. Janson, T. Łuczak, A. Ruciński
Wiley, New York, London • 2000

Similar Papers

Loading similar papers…