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.
@article{10_37236_8986,
author = {Joseph Hyde and Andrew Treglown},
title = {A degree sequence version of the {K\"uhn-Osthus} tiling theorem},
journal = {The electronic journal of combinatorics},
year = {2020},
volume = {27},
number = {3},
doi = {10.37236/8986},
zbl = {1442.05107},
url = {http://geodesic.mathdoc.fr/articles/10.37236/8986/}
}
TY - JOUR
AU - Joseph Hyde
AU - Andrew Treglown
TI - A degree sequence version of the Kühn-Osthus tiling theorem
JO - The electronic journal of combinatorics
PY - 2020
VL - 27
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/8986/
DO - 10.37236/8986
ID - 10_37236_8986
ER -
%0 Journal Article
%A Joseph Hyde
%A Andrew Treglown
%T A degree sequence version of the Kühn-Osthus tiling theorem
%J The electronic journal of combinatorics
%D 2020
%V 27
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/8986/
%R 10.37236/8986
%F 10_37236_8986
Joseph Hyde; Andrew Treglown. A degree sequence version of the Kühn-Osthus tiling theorem. The electronic journal of combinatorics, Tome 27 (2020) no. 3. doi: 10.37236/8986
