Clique factors in random samplings of regular graphs

Wanting Sun, Shunan Wei, Donglei Yang

We show that for any integer $r\ge 2$, there exists a constant $c>0$ such that for every sufficiently large integer $n$, every $((r-1)n+1)$-regular graph $G$ on $rn$ vertices has a…