Sciweavers

COMBINATORICS
2006
107views more  COMBINATORICS 2006»
14 years 15 days ago
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 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch