Lesson 4

So, a tournament may contain a huge number of Hamiltonian paths. How, then, do we determine the winners? Suppose, for example, we want to select two winning teams. It turns out that no matter which two teams we choose, there may be a third team that defeated them both!

Below is an example of such a tournament. For example, teams 0 and 1 lost to team 4, and teams 2 and 3 to team 1.