Packing two copies of a tree into its fourth power Original Research Article

It is well known that if a tree T of order n is not a star, then there exists an edge-disjoint placement of two copies of this tree into the complete graph Kn. We improve this result by proving that actually two copies of T can be edge-disjointly packed in a much smaller graph, namely in T4, the 4th power of T.