H-FACTORS IN DENSE GRAPHS

The following asymptotic result is proved. For every epsilon>0, and fo r every positive integer h, there exists an n(0)=n(0)(epsilon, h) such that for every graph H with h vertices and for every n>n(0), any grap h G with hn vertices and with minimum degree d greater than or equal t o((chi(H)-1)/chi(H)+epsilon) hn contains n vertex disjoint copies of H . This result is asymptotically tight and its proof supplies a polynom ial time algorithm for the corresponding algorithmic problem. (C) 1996 Academic Press, Inc.