For sufficiently large n, every oriented graph G with δ(G) ≥ 2n/3 contains a square Hamilton cycle H with σ_max(H) exceeding a function of δ(G) and n.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Oriented Discrepancy of The Square of Hamilton Cycles
For sufficiently large n, every oriented graph G with δ(G) ≥ 2n/3 contains a square Hamilton cycle H with σ_max(H) exceeding a function of δ(G) and n.