Generalizations of the tree packing conjecture
From MaRDI portal
Abstract: The Gy'arf'as tree packing conjecture asserts that any set of trees with vertices has an (edge-disjoint) packing into the complete graph on vertices. Gy'arf'as and Lehel proved that the conjecture holds in some special cases. We address the problem of packing trees into -chromatic graphs. In particular, we prove that if all but three of the trees are stars then they have a packing into any -chromatic graph. We also consider several other generalizations of the conjecture.
Recommendations
Cited in
(13)- Packing a number of copies of a \(( p , q )\)-graph
- Packing branchings under cardinality constraints on their root sets
- An approximate version of the tree packing conjecture
- Packing trees into \(n\)-chromatic graphs
- \(H\)-packing of \(k\)-chromatic graphs
- On cyclic packing of a tree
- scientific article; zbMATH DE number 4132205 (Why is no real title available?)
- scientific article; zbMATH DE number 89770 (Why is no real title available?)
- Seven largest trees pack
- On the tree packing conjecture
- Packing large balanced trees into bipartite graphs
- scientific article; zbMATH DE number 4145943 (Why is no real title available?)
- Problems close to my heart
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)