Asymptotic formula for the Dirac over-threshold
Asymptotic formula for the Dirac over-threshold
For integers and , let denote the -Dirac over-exponent, and let be the quantity defined in the paper. The asymptotic over-threshold conjecture. There exists a constant such that, for every ,
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.