Sign in
Tree Packing in Complete Graph
Technical documentation   Open access

Tree Packing in Complete Graph

Imdadullah Khan
Rutgers University
2011
DOI:
https://doi.org/10.7282/T3J67MF2

Abstract

A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tree on i vertices, can be packed into Kn. We show that if each Ti is restricted to a star or a path, then the sequence can be packed. We also give an explicit construction for a restricted case when the paths and stars alternate.
pdf
tr5b4d44f17b419122.04 kBDownloadView
Version of Record (VoR)Technical Documentation Open Access

Metrics

47 File downloads
34 Record Views

Details