arXiv (All)
open access
Tournaments with many Hamilton cycles
The object of interest is the maximum number, $h(n)$, of Hamilton cycles in an $n$-tournament. By considering the expected number of Hamilton cycles in various classes of random tournaments, we obtain new asymptotic lower bounds on $h(n)$. The best result so far is approximately $ 2.85584...$ times
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Minimum Mean Cycle Instances#640159
- Weak rainbow saturation numbers of paths, stars and cycles#926704
- Extended symmetric quantum phase in a honeycomb Heisenberg model with sublattice-selective interactions#1051736
- A computational phase diagram for the transverse field Ising model#1157427
- Constrained Optimization of Higher-Order Cluster-Expansion Hamiltonians for Alloys Using Simulated Bifurcation#997203
Record · ID 1327835
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive