Almost-spanning universality in random graphs

David Conlon, Asaf Ferber, Rajko Nenadov +1

A graph $G$ is said to be $\mathcal{H}(n,\Delta )$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\epsilon >0$ and any…