Sandwiching random regular graphs between binomial random graphs

Pu Gao, Mikhail Isaev, Brendan McKay

Kim and Vu made the following conjecture (\textit{Advances in Mathematics}, 2004): if $d\gg \log n$, then the random $d$-regular graph $\mathcal{G}(n,d)$ can asymptotically almost s…