In a certain kind of tournament, every player plays every other player exactly once and either wins or loses. There are no ties. Define a top player to be a player who, for every other player x, either beats x or beats a player y who beats x.
(a) Show that there can be more than one top player.
(b) Use the PMI to show that every n-player tournament has a top player.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.