Packing two copies of a tree into its fourth power (Q1970711)

Let \(G\) be a finite graph of order \(n\). An embedding of \(G\) is an edge-disjoint packing of two copies of \(G\) in the complete graph \(K_n\), in other terms, a packing of \(G\) in its complement. It is well known that a tree, which is not a star, is embeddable. The paper proves a stronger result, namely, that a tree \(T\) can be edge-disjointly packed in \(T^4\), the fourth power of \(T\).