Conjectured minimum degree threshold for Hamilton ellell-cycles

For k3k\ge3, 1<k/21\le\ell<k/2, and kdk1k-\ell\le d\le k-1, let hd(k)h_d^\ell(k) be the limiting normalized minimum dd-degree threshold for Hamilton \ell-cycles. Let t(k,d,)t(k,d,\ell) be the corresponding limiting threshold for an almost perfect tiling by copies of Yk,2Y_{k,2\ell}, where Yk,2Y_{k,2\ell} consists of two kk-edges intersecting in exactly 22\ell vertices. The Hamilton-cycle threshold conjecture. For all such k,,dk,\ell,d,

hd(k)=t(k,d,)=1(112(k))kd.h_d^\ell(k)=t(k,d,\ell)=1-\left(1-\frac{1}{2(k-\ell)}\right)^{k-d}.

The equality is motivated by the space-barrier construction and known evidence, but the source presents it as conjectural; the general statement remains open.

Sources & referencesView supporting material

Primary source

Luyining Gan, Jie Han, Lin Sun and Guanghui Wang, “Large Y_k,b -tilings and Hamilton -cycles in k-uniform hypergraphs”, arXiv:2109.00722 (2021).

Additional references

2 papers in this index state this conjecture (2003–2021). The statement above is taken from the most recent of them; the others are arXiv:math/0310144.

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.