Some remarks on packing trees

DOI10.1016/0012-365X(83)90254-6zbMath0509.05058MaRDI QIDQ1838500

Béla Bollobás

Publication date: 1983

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

zbMATH Keywords

packingcomplete graph

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

An approximate version of the tree packing conjecture ⋮ Packing spanning graphs from separable families ⋮ On packing trees into complete bipartite graphs ⋮ A note on packing trees into complete bipartite graphs and on Fishburn's conjecture ⋮ Packing a number of copies of a \(( p , q )\)-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 of graphs - a survey ⋮ Packing and decomposition of graphs with trees ⋮ Packing degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some remarks on packing trees