Han–Zhao's exact minimum co-degree conjecture for Hamilton ll-cycles

About 6 years old · traced to

Let kk and k/2<ℓ<kk/2<\ell<k be integers such that (k−ℓ)∤k(k-\ell)\nmid k, and let n∈(k−ℓ)Nn\in (k-\ell)\mathbb{N} be sufficiently large. Define

s:=⌈kk−ℓ⌉.s:=\left\lceil \frac{k}{k-\ell}\right\rceil.

For an nn-vertex kk-graph H=(V,E){\mathcal H}=(V,E), write δk−1(H)\delta_{k-1}({\mathcal H}) for its minimum co-degree.

Han–Zhao's conjecture. If

δk−1(H)≥ns(k−ℓ),\delta_{k-1}({\mathcal H})\geq \frac{n}{s(k-\ell)},

then H{\mathcal H} contains a Hamilton ℓ\ell-cycle.

This conjecture proposes the exact minimum co-degree threshold in the remaining range k/2<ℓ<kk/2<\ell<k with (k−ℓ)∤k(k-\ell)\nmid k, extending the cases already resolved for several parameter ranges. The divisibility condition on nn is necessary for a Hamilton ℓ\ell-cycle, and the conjectured threshold is expected to be sharp.

References

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.

Progress summary

Never refreshed

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.