Clique-factors in graphs with sublinear $\ell$-independence number

Jie Han, Ping Hu, Guanghui Wang +1

Given a graph $G$ and an integer $\ell \ge 2$, we denote by ${\alpha }_{\ell }(G)$ the maximum size of a $K_{\ell }$-free subset of vertices in $V(G)$. A recent question of Nenadov and Pehova…