A degree sequence Hajnal-Szemerédi theorem

DOI10.1016/j.jctb.2016.01.007zbMath1332.05117arXiv1412.1774OpenAlexW2295717837MaRDI QIDQ256981

Andrew Treglown

Publication date: 14 March 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

absorbing methodperfect packingregularity method

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (12)

Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ 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 ⋮ Completion and deficiency problems ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ \(K_r\)-factors in graphs with low independence number ⋮ A median-type condition for graph tiling ⋮ On Hamiltonian cycles in hypergraphs with dense link graphs ⋮ A Degree Sequence Komlós Theorem ⋮ A discrepancy version of the Hajnal–Szemerédi theorem ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On directed versions of the Corrádi-Hajnal corollary
• The extremal function for partial bipartite tilings
• Almost \(H\)-factors in dense graphs
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• On perfect packings in dense graphs
• The minimum degree threshold for perfect graph packings
• \(F\)-factors in hypergraphs via absorption
• An Ore-type theorem on equitable coloring
• On Hamilton's ideals
• On Degree Sequences Forcing The Square of a Hamilton Cycle
• On the Complexity of General Graph Factor Problems
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• An Ore-type Theorem for Perfect Packings in Graphs
• Embedding large subgraphs into dense graphs
• Embedding Spanning Bipartite Graphs of Small Bandwidth
• Paths, Trees, and Flowers
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• On Directed Versions of the Hajnal–Szemerédi Theorem
• On the maximal number of independent circuits in a graph
• The Factorization of Linear Graphs
• Testing subgraphs in directed graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: A degree sequence Hajnal-Szemerédi theorem