Grinberg-Introduction-Graph-Theory · Problem 7.2

Independent sets

Mathematics — Graph Theory · tournaments-hamiltonian-paths

Problem

Let nn be a positive integer. Prove that there exists a tournament with nn vertices and at least n!2n−1\dfrac{n!}{2^{n-1}} Hamiltonian paths.

Browse the problem library