Packing large trees of consecutive orders

DOI10.1016/j.disc.2016.07.022zbMath1351.05053arXiv1510.07467OpenAlexW2964242976MaRDI QIDQ2374181

Andrzej Żak

Publication date: 14 December 2016

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

Full work available at URL: https://arxiv.org/abs/1510.07467

zbMATH Keywords

treespacking of graphstree packing conjecture

Mathematics Subject Classification ID

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

Related Items (5)

Packing spanning graphs from separable families ⋮ Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ A blow-up lemma for approximate decompositions ⋮ Optimal packings of bounded degree trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximate version of the tree packing conjecture
• The Turán number of sparse spanning graphs
• Packing trees in complete graphs
• An extremal result for subgraphs with few edges
• On the Tree Packing Conjecture

This page was built for publication: Packing large trees of consecutive orders