Jackson's Hamiltonicity conjecture for regular oriented graphs
Let be an oriented graph, meaning a directed graph with at most one directed edge between each pair of vertices. It is -regular when every vertex has in-neighbours and out-neighbours.
Jackson's conjecture. For each , every -regular oriented graph on vertices has a Hamilton cycle.
The conjecture asserts that regularity substantially lowers the degree threshold for Hamiltonicity in oriented graphs. The paper proves it for sufficiently large as a consequence of a stronger dense cycle-cover theorem, but the stated conjecture is not presented as completely resolved here.
References
3 papers in this index state this conjecture (2010–2023). The statement above is taken from the most recent of them; the others are arXiv:2203.10112, arXiv:1006.0590.
Source: Allan Lo, Viresh Patel and Mehmet Akif Yıldız, “Cycle Partitions in Dense Regular Digraphs and Oriented Graphs”, arXiv:2309.11677 (2025).
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.