Remarks on the placeability of isomorphic trees in a complete graph
Toru Hasunuma, Yukio Shibata · Journal of Graph Theory · 1996
Let Tp be any tree of order p and Δ(Tp) stand for the maximum degree of the vertices of Tp. We prove the following theorem. “If ΔTp ≤ p − i, where p > 2i, then Tp is i-placeable in Kp” is true if and only if i = 1,2, and 3. © 1996 John Wiley & Sons, Inc.