Minimum degree threshold for \(H\)-factors with high discrepancy

DOI10.37236/12145zbMATH Open1548.05181MaRDI QIDQ6614188

Domagoj Bradač, Micha Christoph, Lior Gishboliner

Publication date: 7 October 2024

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

zbMATH Keywords

Hajnal-Szemerédi theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blow-up lemma
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• On the discrepancies of graphs
• Discrepancies of spanning trees and Hamilton cycles
• Graph Theory
• On the Complexity of General Graph Factor Problems
• Proof of a tiling conjecture of Komlós
• A Note on Color-Bias Hamilton Cycles in Dense Graphs
• A discrepancy version of the Hajnal–Szemerédi theorem
• Geometric discrepancy. An illustrated guide
• Proof of the Alon-Yuster conjecture
• Color‐biased Hamilton cycles in random graphs

Related Items (1)

A note on color-bias perfect matchings in hypergraphs

This page was built for publication: Minimum degree threshold for \(H\)-factors with high discrepancy