For a family $\mathcal{ F}$ of graphs, a graph $G$ is called \emph{ $\mathcal{ F}$-universal} if $G$ contains every graph in $\mathcal{ F}$ as a subgraph. Let $\mathcal{ F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at most $d$. Dellamonica, Kohayakawa, R\"odl and Ruci\'nski showed that, for $d\geq 3$, the random graph $G(n,p)$ is $\mathcal{ F}_n(d)$-universal with high probability provided $p\geq C\big(\frac{ \log n}{ n}\big)^{ 1/d}$ for a sufficiently large constant $C=C(d)$. In this paper we prove the missing part of the result, that is, the random graph $G(n,p)$ is $\mathcal{ F}_n(2)$-universal with high probability provided $p\geq C\big(\frac{ \log n}{ n}\big)^{ 1/2}$ for a sufficiently large constant $C$.
Categories: math.CO