Clique-factors in graphs with sublinear -independence number

Given a graph and an integer, we denote by the maximum size of a -free subset of vertices in. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree conditions forcing clique-factors in -vertex graphs with, which can be seen as a Ramsey-Turán variant of the celebrated Hajnal-Szemerédi theorem. In this paper we find the asymptotical sharp minimum degree threshold for -factors in -vertex graphs with for all.