On the maximum number of Hamiltonian paths in tournaments
- 18 April 2001
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 18 (3) , 291-296
Abstract
By using the probabilistic method, we show that the maximum number of directed Hamiltonian paths in a complete directed graph with n vertices is at least (e−o(1)) (n!/2n−1). © 2001 John Wiley & Sons, Inc. Random Struct. Alg., 18: 291–296, 2001Keywords
This publication has 2 references indexed in Scilit:
- The Probabilistic Method2000
- The maximum number of Hamiltonian paths in tournamentsCombinatorica, 1990