On the Tree Packing Conjecture

DOI10.1137/120902719zbMath1316.05098arXiv1212.3627OpenAlexW2080899986WikidataQ123290623 ScholiaQ123290623MaRDI QIDQ5408605

József Balogh, Cory Palmer

Publication date: 10 April 2014

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

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

zbMATH Keywords

tree packing

Mathematics Subject Classification ID

Trees (05C05) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic forms over global rings and fields (11E12) Heights (11G50) Bilinear and Hermitian forms (11E39)

Related Items (11)

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 ⋮ Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ Optimal packings of bounded degree trees ⋮ Packing trees of unbounded degrees in random graphs ⋮ Packing degenerate graphs

This page was built for publication: On the Tree Packing Conjecture