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 Bollobs and Eldridge [5] 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.