paper

Packing degenerate graphs

arXiv:1711.04869 · doi:10.1016/j.aim.2019.106739

Abstract

Given and , whenever is sufficiently small and sufficiently large, if is a family of -degenerate graphs of individual orders at most , maximum degrees at most , and total number of edges at most , then packs into the complete graph . Our proof proceeds by analysing a natural random greedy packing algorithm. This version of the manuscript corrects a small error that appeared in the published version [Adv Math, 354 (2019), 106739].

arXiv comment48 pages. This version corrects small errors that we found after the publication in Adv Math. More details in Section 1.1

References in corpus (7)

Cited by in corpus (4)