Han–Zhao's exact minimum co-degree conjecture for Hamilton ll-cycles
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.