A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order $n$ is $5^{{n-1}\over{3}}$. A known construction shows this number is best possible when $n \equiv 1 \hbox{ mod } 3$ and gives similar minimal values for $n$ congruent to $0$ and $2$ modulo $3$.
1989 ◽
Vol 47
◽
pp. 84-85
Keyword(s):
2020 ◽
Vol 63
(6)
◽
pp. 1947-1957
Keyword(s):
2019 ◽
Vol 9
(9)
◽
pp. p9385
Keyword(s):