Robustness of the Sauer-Spencer Theorem

Abstract

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in [0,1]$, and let $m_1(H)$ be the maximum $1$-density of a graph $H$. We show that for any constant $Δ$ and $γ> 0$, if $G$ is an $n$-vertex host graph with minimum degree $δ(G) \geq (1 - 1/2Δ+ γ)n$ and $H$ is an $n$-vertex graph with maximum degree $Δ(H) \leq Δ$, then for $p \geq Cn^{-1/m_1(H)}\log n$, the random subgraph $G(p)$ contains a copy of $H$ with high probability. Our value for $p$ is optimal up to a log-factor. In fact, we prove this result for a more general minimum degree condition on $G$, by introducing an \emph{extension threshold} $δ_{\rm e}(Δ)$, such that the above result holds for graphs $G$ with ${δ(G) \geq (δ_{\rm e}(Δ) + γ)n}$. We show that $δ_{\rm e}(Δ) \leq (2Δ-1)/2Δ$, and further conjecture that $δ_{\rm e}(Δ)$ equals $Δ/(Δ+1)$, which matches the minimum degree condition on $G$ in the Bollobás-Eldridge-Catlin Conjecture. A main tool in our proof is a vertex-spread version of the blow-up lemma of Allen, Böttcher, Hàn, Kohayakawa, and Person, which we believe to be of independent interest.