Lang–Sanhueza-Matamala tight-component and Hamilton-cycle threshold conjectures
For every odd integer , define . The large-tight-component conjecture asserts that, for sufficiently large , every -vertex -uniform hypergraph satisfying contains a tight component with at least edges, where tight components are the components of the graph on in which two hyperedges are adjacent when they intersect in exactly vertices. The tight-Hamilton-cycle threshold conjecture asserts that, for every odd integer and every integer , the asymptotic minimum -degree threshold for a tight Hamilton cycle in a -uniform hypergraph equals ; equivalently, if is the smallest integer such that every -vertex -uniform hypergraph with minimum -degree at least contains a tight Hamilton cycle, then .
References
- Large tight components and Dirac thresholds for tight Hamilton cycles — arXiv — Hao Lin, Guanghui Wang, Jiande Zhang, Wenling Zhou
Source: arXiv
Progress summary
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 in every .
- Their work gave the upper bound for the general tight-Hamilton-cycle threshold, alongside the lower bound of Han and Zhao.
- The 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.
Solutions 0
No solutions have been posted yet.