Open AccessAlmostH-factors in dense graphs
Author(s) -
Noga Alon,
Raphael Yuster
Publication year - 1992
Publication title -
graphs and combinatorics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.59
H-Index - 40
eISSN - 1435-5914
pISSN - 0911-0119
DOI - 10.1007/bf02350627
Subject(s) - combinatorics , mathematics , disjoint sets , vertex (graph theory) , degree (music) , graph , discrete mathematics , physics , acoustics
The 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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom