A note on -placeable graphs

Let G be a graph of order n . We prove that if the size of G is less than or equal to n − 2 ( k − 1 ) 3 , then the complete graph K n contains k edge-disjoint copies of G . The case k = 2 is well known.