A discrepancy version of the Hajnal–Szemerédi theorem

DOI10.1017/S0963548320000516zbMath1466.05174arXiv2002.12594OpenAlexW3096772174MaRDI QIDQ4993133

Béla Csaba, Andrew Treglown, András Pluhár, József Balogh

Publication date: 15 June 2021

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Hajnal-Szemerédi theoremperfect \(K_r\)-tiling

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 (6)

Powers of Hamilton cycles of high discrepancy are unavoidable ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Oriented discrepancy of Hamilton cycles ⋮ Color‐biased Hamilton cycles in random graphs ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs ⋮ A Note on Color-Bias Hamilton Cycles in Dense Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• Packings of graphs and applications to computational complexity
• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• \(H\)-factors in dense graphs
• On the discrepancies of graphs
• A multipartite Hajnal-Szemerédi theorem
• An Ore-type theorem on equitable coloring
• On the Complexity of General Graph Factor Problems
• TILING DIRECTED GRAPHS WITH TOURNAMENTS
• Critical chromatic number and the complexity of perfect packings in graphs
• Robustness of graph properties
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: A discrepancy version of the Hajnal–Szemerédi theorem