Note on compact packing of a graph Original Research Article

Let G be a simple graph of order n and size e(G). It is well known that if e(G)⩽n−2 then there is an edge-disjoint placement of two copies of G into Kn. We prove that with the same condition on the size of G we have actually a compact packing of G, that is an edge-disjoint placement of two copies of G into Kn⧹Kk with k=⌊(n+3)/3⌋.