Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Graph Theorymedium
0:00.0

In a tournament (directed complete graph), a Hamiltonian path always exists. How many Hamiltonian paths can the tournament on 3 vertices have?