Let G1 and G2 be simple graphs on n vertices. If there are edge-disjoint copies of G1 and G2 in Kn, then we say there is a packing of G1 and G2. A conjecture of Bollobás and Eldridge asserts that if (Δ(G1) + 1)(Δ(G2) +1) ≤ n+1 then there is a packing of G1 and G2. We prove this conjecture when Δ(G1)=3, for sufficiently large n.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics