A degree sequence version of the Kühn-Osthus tiling theorem (Q2195226)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A degree sequence version of the Kühn-Osthus tiling theorem |
scientific article |
Statements
A degree sequence version of the Kühn-Osthus tiling theorem (English)
0 references
8 September 2020
0 references
Summary: A fundamental result of \textit{D. Kühn} and \textit{D. Osthus} [``The minimum degree threshold for perfect graph packings'', Combinatorica 29, No. 1, 65--107 (2009; \url{doi:10.1007/s00493-009-2254-3})] 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.
0 references
