Tennis Tournament
Source: Irish MO 2004
May 3, 2012
combinatorics unsolvedcombinatorics
Problem Statement
Each of the players in a tennis tournament played one match against each of
the others. If every player won at least one match, show that there is a group
A; B; C of three players for which A beat B, B beat C and C beat A.