A degree sequence version of the Kühn-Osthus tiling theorem

DOI10.37236/8986zbMath1442.05107arXiv1909.12670OpenAlexW3083240324MaRDI QIDQ2195226

Andrew Treglown, Joseph Hyde

Publication date: 8 September 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12670

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ Graph Tilings in Incompatibility Systems ⋮ On sufficient conditions for spanning structures in dense graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best monotone degree conditions for graph properties: a survey
• Blow-up lemma
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• On perfect packings in dense graphs
• The minimum degree threshold for perfect graph packings
• An Ore-type theorem on equitable coloring
• On Hamilton's ideals
• Large planar subgraphs in dense graphs
• On the Complexity of General Graph Factor Problems
• Critical chromatic number and the complexity of perfect packings in graphs
• Proof of a tiling conjecture of Komlós
• A Degree Sequence Komlós Theorem
• Proof of the Alon-Yuster conjecture

This page was built for publication: A degree sequence version of the Kühn-Osthus tiling theorem