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