Böttcher, JuliaJuliaBöttcherHladký, JanJanHladkýPiguet, DianaDianaPiguetTaraz, AnuschAnuschTaraz2020-04-292020-04-292016-02-01Israel Journal of Mathematics 1 (211): 391-446 (2016-02-01)http://hdl.handle.net/11420/5974We prove that for any pair of constants ɛ > 0 and Δ and for n sufficiently large, every family of trees of orders at most n, maximum degrees at most Δ, and with at most (n2) edges in total packs into (Formula presented.). This implies asymptotic versions of the Tree Packing Conjecture of Gyárfás from 1976 and a tree packing conjecture of Ringel from 1963 for trees with bounded maximum degree. A novel random tree embedding process combined with the nibble method forms the core of the proof.en0021-217220161391446Journal Article10.1007/s11856-015-1277-2Other