(1) TU Ilmenau, Fakultät für Mathematik und Wissenschaften, Weimarer Strasse 25, 98684 Ilmenau, Germany;(2) Department of Discrete Mathematics, Faculty of Applied Mathematics AGH, Al. Mickiewicza 30, 0-059 Kraków, Poland
Abstract:
We prove that there exists a packing of copies of a tree of size into Kn. Moreover, the proof provides an easy algorithm.Acknowledgments. The research of the second author was partially supported by Deutscher Akademischer Austauschdienst.
copies of a tree of size 
into Kn. Moreover, the proof provides an easy algorithm.Acknowledgments. The research of the second author was partially supported by Deutscher Akademischer Austauschdienst.