Generalizations of the tree packing conjecture

From MaRDI portal




Abstract: The Gy'arf'as tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (edge-disjoint) packing into the complete graph on k vertices. Gy'arf'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into k-chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any k-chromatic graph. We also consider several other generalizations of the conjecture.











This page was built for publication: Generalizations of the tree packing conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648788)