Ai–Guo–Freschi–Lo Ore-type conjecture for oriented Hamilton cycles
Let be an oriented graph, that is, a loopless directed graph with at most one edge between any two vertices. For a vertex, let its total degree be the number of incident edges, and let be the minimum total degree. For an oriented cycle , let and be the numbers of edges traversed in the forward and backward directions, respectively, and define
For non-adjacent vertices , meaning that there is no edge between them, define
Ai–Guo–Freschi–Lo conjecture. Let be an oriented graph on vertices. If , then contains a Hamilton cycle such that
This is an Ore-type extension of the oriented discrepancy analogue of Dirac's theorem. The supplied text says the problem was proposed as a conjecture by Ai et al.; the paper itself resolves the corresponding asymptotic result, but does not state that this exact conjecture has been solved.
References
- Yufei Chang, Yangyang Cheng, Zhilan Wang, Shuo Wei and Jin Yan, “An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles”, arXiv:2603.18915 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.