TY - JOUR
T1 - Decomposing large graphs with small graphs of high density
AU - Yuster, Raphael
PY - 1999/9
Y1 - 1999/9
N2 - It is shown that for every positive integer h, and for every ε > 0, there are graphs H = (VH, EH) with at least h vertices and with density at least 0.5 - ε with the following property: If G = (VG, EG) is any graph with minimum degree at least |VG|/2 (1 + o(1)) and \EH| divides \EG|, then G has an H-decomposition. This result extends the results of [R. M. Wilson, Cong Numer XV (1925), 647-659] [T. Gustavsson, Ph.D. Thesis, U. Stockholm, 1991] [R. Yuster, Random Struc Algorith, 12 (1998), 237-251].
AB - It is shown that for every positive integer h, and for every ε > 0, there are graphs H = (VH, EH) with at least h vertices and with density at least 0.5 - ε with the following property: If G = (VG, EG) is any graph with minimum degree at least |VG|/2 (1 + o(1)) and \EH| divides \EG|, then G has an H-decomposition. This result extends the results of [R. M. Wilson, Cong Numer XV (1925), 647-659] [T. Gustavsson, Ph.D. Thesis, U. Stockholm, 1991] [R. Yuster, Random Struc Algorith, 12 (1998), 237-251].
KW - Decomposition
KW - Dense graphs
UR - http://www.scopus.com/inward/record.url?scp=0033423185&partnerID=8YFLogxK
U2 - 10.1002/(SICI)1097-0118(199909)32:1<27::AID-JGT3>3.0.CO;2-C
DO - 10.1002/(SICI)1097-0118(199909)32:1<27::AID-JGT3>3.0.CO;2-C
M3 - Article
AN - SCOPUS:0033423185
SN - 0364-9024
VL - 32
SP - 27
EP - 40
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 1
ER -