Edge-disjoint placement of three trees (Q1922881): Difference between revisions

We say that there is a packing of \(G_1,\dots,G_k\) (into the complete graph \(K_n\)) if there exist injections \(\sigma_i:V(G_i)\to V(K_n)\), \(i=1,\dots,k\), such that \(\sigma^*_i(E(G_i))\cap\sigma^*_j(E(G_j))=\varnothing\) for \(i\neq j\), where the map \(\sigma^*_i:E(G_i)\to E(K_n)\) is the one induced by \(\sigma_i\). A packing of \(k\) copies of a graph \(G\) is called a \(k\)-placement of \(G\). This paper gives all the triples of trees of order \(n\) for which there is a packing into \(K_n\).