Abstract
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) |
---|---|
Pages (from-to) | 319-324 |
Number of pages | 6 |
Journal | Combinatorica |
Volume | 10 |
Issue number | 4 |
DOIs | |
State | Published - Dec 1990 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Discrete Mathematics and Combinatorics
Keywords
- AMS subject classification (1980): 05C20, 05C35, 05C38