Sciweavers

DAM
2000
83views more  DAM 2000»
13 years 4 months ago
Pancyclic out-arcs of a Vertex in Tournaments
Thomassen (J. Combin. Theory Ser. B 28, 1980, 142
Tianxing Yao, Yubao Guo, Kemin Zhang
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 4 months 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