TY - JOUR
T1 - H-factors in dense graphs
AU - Alon, Noga
AU - Yuster, Raphael
N1 - Funding Information:
* Research supported in part by the Fund for Basic Research administered by the Israel Academy of Sciences.
PY - 1996/3
Y1 - 1996/3
N2 - The following asymptotic result is proved. For every ε > 0, and for every positive integer h, there exists an n0 = n0(ε, h) such that for every graph H with h vertices and for every n>n0, any graph G with hn vertices and with minimum degree d≥((x(H) - 1)/x(H) +ε) hn contains n vertex disjoint copies of H. This result is asymptotically tight and its proof supplies a polynomial time algorithm for the corresponding algorithmic problem.
AB - The following asymptotic result is proved. For every ε > 0, and for every positive integer h, there exists an n0 = n0(ε, h) such that for every graph H with h vertices and for every n>n0, any graph G with hn vertices and with minimum degree d≥((x(H) - 1)/x(H) +ε) hn contains n vertex disjoint copies of H. This result is asymptotically tight and its proof supplies a polynomial time algorithm for the corresponding algorithmic problem.
UR - https://www.scopus.com/pages/publications/0030102833
U2 - 10.1006/jctb.1996.0020
DO - 10.1006/jctb.1996.0020
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030102833
SN - 0095-8956
VL - 66
SP - 269
EP - 282
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 2
ER -