Han–Zhao's exact minimum co-degree conjecture for Hamilton ll-cycles
Han–Zhao's exact minimum co-degree conjecture for Hamilton ll-cycles
Let and be integers such that , and let be sufficiently large. Define
For an -vertex -graph , write for its minimum co-degree.
Han–Zhao's conjecture. If
then contains a Hamilton -cycle.
This conjecture proposes the exact minimum co-degree threshold in the remaining range with , extending the cases already resolved for several parameter ranges. The divisibility condition on is necessary for a Hamilton -cycle, and the conjectured threshold is expected to be sharp.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Luyining Gan, Jie Han and Huan Xu, “Exact minimum co-degree conditions for -Hamiltonicity in hypergraphs”, arXiv:2602.00605 (2026).
Additional references
3 papers in this index state this conjecture (2020–2026). The statement above is taken from the most recent of them; the others are arXiv:2412.14891, arXiv:2005.05291.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.