A Note on Color-Bias Hamilton Cycles in Dense Graphs

DOI10.1137/20M1378983zbMath1465.05093arXiv2011.03948MaRDI QIDQ4990398

Andrea Freschi, Joanna Lada, Joseph Hyde, Andrew Treglown

Publication date: 28 May 2021

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

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

zbMATH Keywords

discrepancyHamilton cyclescolor-bias

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)

Related Items (4)

Powers of Hamilton cycles of high discrepancy are unavoidable ⋮ Discrepancies of spanning trees and Hamilton cycles ⋮ Oriented discrepancy of Hamilton cycles ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the discrepancies of graphs
• A discrepancy version of the Hajnal–Szemerédi theorem

This page was built for publication: A Note on Color-Bias Hamilton Cycles in Dense Graphs