3 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
Asaf Ferber, Rajko Nenadov, Ueli Peter
In this paper we show how to use simple partitioning lemmas in order to embed spanning graphs in a typical member of G(n,p). Let the \emph{maximum density} of a graph H be the…