OpenAlex ·
The maximum number of Hamiltonian cycles in tournaments
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.23755
- Original
- Read it at the publisher
- Topics
Abstract
Let $C(n)$ denote the maximum number of directed Hamiltonian cycles in a tournament on $n$ vertices. We prove that, as $n\to\infty$, $$ C(n) = \left(\frac{\cosh 1}{\cos 1}\pm o(1)\right)\frac{(n-1)!}{2^n}. $$ The bound is asymptotically attained by the regular tournament with vertices $\mathbb Z/n\mathbb Z$ where $(i,j)$ is a directed edge if $j - i \pmod n< n/2$. This answers a question of Alon and proves a conjecture of Wormald. Among the other implications of these results is asymptotically determining the maximum number of Hamiltonian paths in a tournament on $n$ vertices. We provide our own exposition of these proofs, which were originally found by GPT-5.6.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
Near optimal gap in the Lonely Runner Conjecture
An example of a non-sofic hyperbolic group
Approximating Independent Sets Using Additive Combinatorics
New lower bounds for binary constant-weight codes from prescribed-automorphism search, and two quantum codes meeting their upper bounds
A simplified proof of the FPRAS for counting perfect matchings
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.