The complete picture for clique factors in randomly perturbed graphs

Abstract

A randomly perturbed graph $G^p = G_α\cup G_{n,p}$ is obtained by taking a deterministic $n$-vertex graph $G_α= (V, E)$ with minimum degree $δ(G)\geq αn$ and adding the edges of the binomial random graph $G_{n,p}$ defined on the same vertex set $V$. For which value $p$ (depending on $α$) does the graph $G^p$ contain a $K_r$-factor -- a spanning collection of vertex-disjoint copies of $K_r$ -- with high probability? The order of magnitude of the minimum such $p$ was determined whenever $α\neq 1- \frac{s}{r}$ for an integer $s$ by Balogh, Treglown and Wagner, and by Han, Morris and Treglown. In earlier work, the first three authors determined this threshold probability $p_s$ up to a constant factor for all values of $α= 1-\frac{s}{r}\leq \frac 12$. Here, we complete the picture by establishing $p_s$ in the remaining case $α> \frac12$. A key ingredient in our approach is an extremal result of independent interest: we prove a fractional stability version of a tiling theorem due to Shokoufandeh and Zhao.