Geodesic
A note on the number of Hamiltonian paths in strong tournaments
The electronic journal of combinatorics, Tome 13 (2006)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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$.
DOI : 10.37236/1141
Classification : 05C20, 05C38, 05C45 
Arthur H. Busch. A note on the number of Hamiltonian paths in strong tournaments. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1141
@article{10_37236_1141,
     author = {Arthur H. Busch},
     title = {A note on the number of {Hamiltonian} paths in strong tournaments},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1141},
     zbl = {1080.05038},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1141/}
}
TY  - JOUR
AU  - Arthur H. Busch
TI  - A note on the number of Hamiltonian paths in strong tournaments
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1141/
DO  - 10.37236/1141
ID  - 10_37236_1141
ER  - 
%0 Journal Article
%A Arthur H. Busch
%T A note on the number of Hamiltonian paths in strong tournaments
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1141/
%R 10.37236/1141
%F 10_37236_1141

Cité par Sources :