A note on the number of Hamiltonian paths in strong tournaments
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.
scientific article; zbMATH DE number 5005206
scientific article