A Degree Sequence Komlós Theorem

DOI10.1137/18M1197102zbMath1425.05080arXiv1807.10203OpenAlexW2981560094MaRDI QIDQ5238748

Joseph Hyde, Hong Liu, Andrew Treglown

Publication date: 28 October 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

degree sequenceregularity methodgraph tilings

Mathematics Subject Classification ID

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

Related Items

A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ A degree sequence version of the Kühn-Osthus tiling theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• The extremal function for partial bipartite tilings
• 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
• TILING DIRECTED GRAPHS WITH TOURNAMENTS
• Critical chromatic number and the complexity of perfect packings in graphs
• Proof of a tiling conjecture of Komlós
• A Density Corrádi–Hajnal Theorem
• A median-type condition for graph tiling
• Proof of the Alon-Yuster conjecture

This page was built for publication: A Degree Sequence Komlós Theorem