A note on the number of Hamiltonian paths in strong tournaments (Q813441): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 01:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the number of Hamiltonian paths in strong tournaments |
scientific article |
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
