Packing Trees into the Complete Graph
From MaRDI portal
Publication:3147238
Recommendations
Cited in
(14)- Almost regular edge colorings and regular decompositions of complete graphs
- Packing trees of unbounded degrees in random graphs
- Packing spanning graphs from separable families
- An approximate version of the tree packing conjecture
- Packing trees of bounded diameter into the complete graph
- Packing trees in complete graphs
- scientific article; zbMATH DE number 398941 (Why is no real title available?)
- A blow-up lemma for approximate decompositions
- scientific article; zbMATH DE number 3924795 (Why is no real title available?)
- Asymptotically optimal tree-packings in regular graphs
- Optimal packings of bounded degree trees
- A note on packing two copies of a tree into a graph with small maximum degree
- Packing three copies of a tree into a complete bipartite graph
- Packing four copies of a tree into a complete bipartite graph
This page was built for publication: Packing Trees into the Complete Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147238)