← All problems

Lang–Sanhueza-Matamala tight-component and Hamilton-cycle threshold conjectures

For every odd integer r≥3r\ge 3, define qr=1−2−r(r(r−1)/2)q_r=1-2^{-r}\binom{r}{(r-1)/2}. The large-tight-component conjecture asserts that, for sufficiently large nn, every nn-vertex rr-uniform hypergraph HH satisfying e(H)≥qr(nr)e(H)\ge q_r\binom{n}{r} contains a tight component with at least (1/2−o(1))(nr)(1/2-o(1))\binom{n}{r} edges, where tight components are the components of the graph on E(H)E(H) in which two hyperedges are adjacent when they intersect in exactly r−1r-1 vertices. The tight-Hamilton-cycle threshold conjecture asserts that, for every odd integer r≥1r\ge 1 and every integer k≥⌈r(3−2qr)⌉k\ge\lceil r(3-2q_r)\rceil, the asymptotic minimum (k−r)(k-r)-degree threshold for a tight Hamilton cycle in a kk-uniform hypergraph equals qrq_r; equivalently, if hk(k−r)(n)h_k^{(k-r)}(n) is the smallest integer such that every nn-vertex kk-uniform hypergraph with minimum (k−r)(k-r)-degree at least hk(k−r)(n)h_k^{(k-r)}(n) contains a tight Hamilton cycle, then lim⁡n→∞hk(k−r)(n)/(n−(k−r)r)=qr\lim_{n\to\infty}h_k^{(k-r)}(n)/\binom{n-(k-r)}{r}=q_r.

References

Source: arXiv

Progress summary

Refreshed
Open · progress reported

An unrefereed preprint claims major progress on both conjectures, but the full package is not yet verified.

The problem concerns conjectures of Lang and Sanhueza-Matamala on large tight components and minimum codegree thresholds for tight Hamilton cycles. The retrieved record identifies earlier work by the same authors, but not a prior complete resolution.

Known results

  • Lang and Sanhueza-Matamala (2022) determined asymptotically sharp conditions for d=k−2d=k-2 in every k≥3k\ge 3.
  • Their work gave the upper bound 1−1/(2(k−d))1-1/(2(k-d)) for the general tight-Hamilton-cycle threshold, alongside the lower bound 1−1/k−d1-1/\sqrt{k-d} of Han and Zhao.
  • The d=k−2d=k-2 result was also obtained independently by Polcyn, Reiher, Rödl, and Schülke.

October 2026 preprint

On October 28, 2026, Hao Lin, Guanghui Wang, Jiande Zhang, and Wenling Zhou reported that odd-uniformity hypergraphs contain a tight component of the conjectured size and determined the asymptotic codegree threshold for tight Hamilton cycles in a stated range of parameters. This is claimed progress, not an independently verified resolution; the Hamilton-cycle result is restricted to that range.

Current status (as of October 2026): The odd-uniformity tight-component conjecture and a restricted Hamilton-cycle threshold are claimed in an unrefereed preprint, while the full conjecture package remains unverified and open.

Sources

Solutions 0

No solutions have been posted yet.