Spectral Extremal Graphs without a $K_k$-Factor

Cunxiang Duan, Tingting Han, Lin-Peng Zhang

Let $k\ge 3$ and let $n=km$. A $K_k$-factor in an $n$-vertex graph is a collection of $m$ vertex-disjoint copies of $K_k$ that covers the entire vertex set. We determine the maximu…