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· n!/2n-1, where c is a positive constant independent of n.
|Original language||English (US)|
|Number of pages||6|
|State||Published - Dec 1 1990|
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics