Powers of Hamilton cycles of high discrepancy are unavoidable

DOI10.37236/10279zbMath1494.05063arXiv2102.10912OpenAlexW4288715932MaRDI QIDQ2161210

Domagoj Bradač

Publication date: 4 August 2022

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Oriented discrepancy of Hamilton cycles ⋮ Localized versions of extremal problems

Cites Work

• Proof of the Seymour conjecture for large graphs
• Blow-up lemma
• On the discrepancies of graphs
• Discrepancies of spanning trees and Hamilton cycles
• A Note on Color-Bias Hamilton Cycles in Dense Graphs
• A discrepancy version of the Hajnal–Szemerédi theorem
• Geometric discrepancy. An illustrated guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Powers of Hamilton cycles of high discrepancy are unavoidable