Asymptotic formula for the Dirac over-threshold

For integers k2k\geq2 and mm, let ηˉk,m\bar\eta_{k,m} denote the (k,m)(k,m)-Dirac over-exponent, and let f(k,m)f(\ell_{k,m}) be the quantity defined in the paper. The asymptotic over-threshold conjecture. There exists a constant mkm_k such that, for every mmkm\geq m_k,

ηˉk,m=1f(k,m).\bar\eta_{k,m}=\frac{1}{f(\ell_{k,m})}.

The conjecture asserts that the lower bound obtained in the paper gives the exact over-threshold for all sufficiently large path powers. The source presents it as open and notes that an appropriately strengthened version of a preceding lemma would imply it.

Sources & referencesView supporting material

Primary source

Sylwia Antoniuk, Andrzej Dudek and Andrzej Ruciński, “Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs”, arXiv:2512.23886 (2025).

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.