Oriented discrepancy of Hamilton cycles
From MaRDI portal
Publication:6047963
DOI10.1002/jgt.22947zbMath1522.05261arXiv2203.07148MaRDI QIDQ6047963
Michael Krivelevich, Lior Gishboliner, Peleg Michaeli
Publication date: 10 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.07148
Cites Work
- A survey on Hamilton cycles in directed graphs
- The size Ramsey number of a directed path
- On a theorem of Rademacher-Turán
- Hamiltonian circuits in random graphs
- Advances on the Hamiltonian problem -- a survey
- Cycle lengths in expanding graphs
- Powers of Hamilton cycles of high discrepancy are unavoidable
- On the discrepancies of graphs
- Recent advances on the Hamiltonian problem: survey III
- Discrepancies of spanning trees and Hamilton cycles
- Updating the hamiltonian problem—A survey
- Hamilton cycles in graphs and hypergraphs: an extremal perspective
- A Note on Color-Bias Hamilton Cycles in Dense Graphs
- A discrepancy version of the Hajnal–Szemerédi theorem
- Robustness of graph properties
- Long paths and Hamiltonicity in random graphs
- Some Theorems on Abstract Graphs
- Geometric discrepancy. An illustrated guide
- Color‐biased Hamilton cycles in random graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Oriented discrepancy of Hamilton cycles