In a tennis tournament of 100 people, each player plays every other players exactly once. There is no draw in a tennis game, one side always wins.
Given that no player loses all of his games, prove that there is a cycle of exactly 3 players. That is, there are players A,B, and C such that A defeats B, B defeats C, and C defeats A.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment