A Degree Sequence Version of the Kühn–Osthus Tiling Theorem

  • Joseph Hyde
  • Andrew Treglown
DOI: https://doi.org/10.37236/8986

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.

Published
2020-09-04
How to Cite
Hyde, J., & Treglown, A. (2020). A Degree Sequence Version of the Kühn–Osthus Tiling Theorem. The Electronic Journal of Combinatorics, 27(3), P3.48. https://doi.org/10.37236/8986
Issue
Volume 27, Issue 3 (2020)
Article Number
P3.48