Papers › Improved asymptotic upper bounds for the minimum number of pairwise distinct longest...
Improved asymptotic upper bounds for the minimum number of pairwise distinct longest cycles in regular graphs
Jorik Jooken
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer r ≥5, we give exponential improvements for the best asymptotic upper bounds for this invariant under the additional constraint that the graphs are r-regular hamiltonian graphs. Earlier work showed that a conjecture by Haythorpe on a lower bound for this invariant is false because of an incorrect constant factor, whereas our results imply that the conjecture is even asymptotically incorrect. Motivated by a question of Zamfirescu and work of Chia and Thomassen, we also study this invariant for non-hamiltonian 2-connected r-regular graphs and show that in this case the invariant can be bounded from above by a constant for all large enough graphs, even for graphs with arbitrarily large girth.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections