A note on the number of Hamiltonian paths in strong tournaments (Q813441)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the number of Hamiltonian paths in strong tournaments |
scientific article; zbMATH DE number 5005206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the number of Hamiltonian paths in strong tournaments |
scientific article; zbMATH DE number 5005206 |
Statements
A note on the number of Hamiltonian paths in strong tournaments (English)
0 references
9 February 2006
0 references
Summary: We prove that the minimum number of distinct Hamiltonian paths in a strong tournament of order \(n\) is \(5^{\frac {n-1}3}\). A known construction shows this number is best possible when \(n \equiv 1 \bmod 3\) and gives similar minimal values for \(n\) congruent to 0 and 2 modulo 3.
0 references
0.9321503
0 references
0.91633415
0 references
0.91203874
0 references
0.90521073
0 references
0.89817643
0 references
