Packing degenerate graphs
Allen, P.
, Böttcher, J., Hladký, J. & Piguet, D.
(2019).
Packing degenerate graphs.
Advances in Mathematics,
354,
https://doi.org/10.1016/j.aim.2019.106739
, Böttcher, J., Hladký, J. & Piguet, D.
(2019).
Packing degenerate graphs.
Advances in Mathematics,
354,
https://doi.org/10.1016/j.aim.2019.106739
Given D and γ>0, whenever c>0 is sufficiently small and n sufficiently large, if G is a family of D-degenerate graphs of individual orders at most n, maximum degrees at most cnlogn, and total number of edges at most (1−γ)(n2), then G packs into the complete graph Kn. Our proof proceeds by analysing a natural random greedy packing algorithm.
