Clique-factors in sparse pseudorandom graphs

Abstract

We prove that for any $t\ge 3$ there exist constants $c>0$ and $n_0$ such that any $d$-regular $n$-vertex graph $G$ with $t\mid n\ge n_0$ and second largest eigenvalue in absolute value $\hat{I}»$ satisfying $\hat{I}»\le c{d}^t/n^{t-1}$ contains a $K_t$-factor, that is, vertex-disjoint copies of $K_t$ covering every vertex of $G$. The result generalizes to broader setting of jumbled graphs, which were introduced by Thomason in the eighties.

6 pages, final version