In a certain kind of tournament, every player plays every other player exactlyonce and
Chapter 2, Problem 13(choose chapter or problem)
In a certain kind of tournament, every player plays every other player exactlyonce and either wins or loses. There are no ties. Define a top player to be a playerwho, 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
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer