Packing Trees into the Complete Graph
From MaRDI portal
Publication:3147238
DOI10.1017/S0963548301005077zbMath1032.05112OpenAlexW2102791155MaRDI QIDQ3147238
Publication date: 18 September 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548301005077
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
An approximate version of the tree packing conjecture ⋮ Packing spanning graphs from separable families ⋮ A blow-up lemma for approximate decompositions ⋮ Optimal packings of bounded degree trees ⋮ Almost regular edge colorings and regular decompositions of complete graphs ⋮ Packing trees of unbounded degrees in random graphs