A degree sequence version of the Kühn-Osthus tiling theorem
arXiv:1909.12670
Abstract
A fundamental result of Kühn and Osthus [The minimum degree threshold for perfect graph packings, Combinatorica, 2009] determines up to an additive constant the minimum degree threshold that forces a graph to contain a perfect H-tiling. We prove a degree sequence version of this result which allows for a significant number of vertices to have lower degree.
23 pages, 1 figure