Packing trees in complete graphs

DOI10.1016/0012-365X(87)90164-6zbMath0642.05043OpenAlexW2008161614MaRDI QIDQ1101132

Arthur M. Hobbs, Jothi Kasiraj, Brian A. Bourgeois

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90164-6

zbMATH Keywords

graph decompositiontree packing

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (18)

An approximate version of the tree packing conjecture ⋮ On Erdős-Sós conjecture for trees of large size ⋮ Packing spanning graphs from separable families ⋮ Packing large trees of consecutive orders ⋮ On packing trees into complete bipartite graphs ⋮ A note on packing of three forests ⋮ Packing four copies of a tree into a complete bipartite graph ⋮ Packing three trees ⋮ A note on packing trees into complete bipartite graphs and on Fishburn's conjecture ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Packing three copies of a tree into a complete bipartite graph ⋮ A blow-up lemma for approximate decompositions ⋮ Unnamed Item ⋮ Optimal packings of bounded degree trees ⋮ Packing trees of unbounded degrees in random graphs ⋮ Packing sequences ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Mutual placement of bipartite graphs

Cites Work

• Packings of graphs and applications to computational complexity
• Balanced integer arrays: a matrix packing theorem
• Packing a tree with a graph of the same size
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Packing trees in complete graphs