TY - JOUR
T1 - Packing of graphs with small product of sizes
AU - Kostochka, Alexandr V.
AU - Yu, Gexin
N1 - Funding Information:
E-mail addresses: [email protected] (A.V. Kostochka), [email protected] (G. Yu). 1 Research supported in part by NSF grant DMS-0650784 and RFBR grant 05-01-00816. 2 Research supported in part by NSF grant DMS-0652306.
PY - 2008/11
Y1 - 2008/11
N2 - We show that for every ε{lunate} > 0, there exists n0 = n0 (ε{lunate}) such that for every n > n0, two n-vertex graphs G1 and G2 with e (G1) e (G2) ≤ (1 - ε{lunate}) n2 pack, unless they belong to a well-defined family of exceptions. This extends a well-known result by Sauer and Spencer.
AB - We show that for every ε{lunate} > 0, there exists n0 = n0 (ε{lunate}) such that for every n > n0, two n-vertex graphs G1 and G2 with e (G1) e (G2) ≤ (1 - ε{lunate}) n2 pack, unless they belong to a well-defined family of exceptions. This extends a well-known result by Sauer and Spencer.
KW - Graph packing
UR - http://www.scopus.com/inward/record.url?scp=52149107746&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52149107746&partnerID=8YFLogxK
U2 - 10.1016/j.jctb.2008.02.004
DO - 10.1016/j.jctb.2008.02.004
M3 - Article
AN - SCOPUS:52149107746
SN - 0095-8956
VL - 98
SP - 1411
EP - 1415
JO - Journal of Combinatorial Theory. Series B
JF - Journal of Combinatorial Theory. Series B
IS - 6
ER -