The complete picture for clique factors in randomly perturbed graphs

Sylwia Antoniuk, Nina Kamčev, Christian Reiher +1

A randomly perturbed graph $G^p=G_{\alpha }\cup G_{n,p}$ is obtained by taking a deterministic $n$-vertex graph $G_{\alpha }=(V,E)$ with minimum degree $\delta (G)\ge \alpha n$ and adding the edges of th…