AlmostH-factors in dense graphs

AbstractThe following asymptotic result is proved. For every fixed graphH withh vertices, any graphG withn vertices and with minimum degree $$d \geqslant \frac{{\chi (H) - 1}}{{\chi (H)}}n$$ contains (1−o(1))n/h vertex disjoint copies ofH.