Allen, PeterPeterAllenBöttcher, JuliaJuliaBöttcherClemens, DennisDennisClemensTaraz, AnuschAnuschTaraz2023-01-112023-01-112023-06Israel Journal of Mathematics 255 (2): 501-579 (2023-06)http://hdl.handle.net/11420/14550We prove that one can perfectly pack degenerate graphs into complete or dense n-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree(Formula Presented.)., and in addition Ω(n) of them have at most (1 − Ω(1))n vertices and Ω(n) leaves. This proves Ringel’s conjecture and the Gyárfás Tree Packing Conjecture for all but an exponentially small fraction of trees (or sequences of trees, respectively).en0021-217220232501579Journal Article10.1007/s11856-022-2447-7Journal Article