Embedding clique-factors in graphs with low $\ell$-independence number

Fan Chang, Jie Han, Jaehoon Kim +2

The following question was proposed by Nenadov and Pehova and reiterated by Knierim and Su: Given integers $\ell ,r$ and $n$ with $n\in r\mathbb{N}$, is it true that every $n$-verte…