Summary: The Maximum Number of Hamiltonian Paths in Tournaments
Raymond and Beverly Sackler Faculty of Exact Sciences
School of Mathematical Sciences
Tel Aviv University
Ramat Aviv, Tel-Aviv, Israel
* Research supported in part by a U.S.A.-Israel BSF grant and by a Bergmann Memorial Grant.
Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian
paths in a tournament on n vertices is at most c · n3/2
2n-1 , where c is a positive constant
independent of n.
A tournament T is an oriented complete graph. A Hamiltonian path in T is a spanning
directed path in it. Let P(T) denote the number of Hamiltonian paths in T. For n 2, define
P(n) = max P(T), where T ranges over all tournaments on n vertices. More than forty years ago,
Szele [Sz] showed that