A degree sequence version of the K\"uhn-Osthus tiling theorem
Combinatorics
2019-09-30 v1
Abstract
A fundamental result of K\"uhn 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.
Keywords
Cite
@article{arxiv.1909.12670,
title = {A degree sequence version of the K\"uhn-Osthus tiling theorem},
author = {Joseph Hyde and Andrew Treglown},
journal= {arXiv preprint arXiv:1909.12670},
year = {2019}
}
Comments
23 pages, 1 figure