A minimum degree of (1+o(1))n in an n-vertex digraph forces every orientation of a Hamilton cycle, except the directed cycle when the graph is not strongly connected.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
A minimum degree of (1+o(1))n in an n-vertex digraph forces every orientation of a Hamilton cycle, except the directed cycle when the graph is not strongly connected.