| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657275 | Journal of Combinatorial Theory, Series B | 2008 | 5 Pages |
Abstract
We show that for every ϵ>0, there exists n0=n0(ϵ) such that for every n>n0, two n-vertex graphs G1 and G2 with e(G1)e(G2)⩽(1−ϵ)n2 pack, unless they belong to a well-defined family of exceptions. This extends a well-known result by Sauer and Spencer.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
