Abstract

AbstractBy 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, 2001

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call