A tournament
Source: Iran TST 2008
May 25, 2008
inequalitiescombinatorics proposedcombinatoricsHi
Problem Statement
Prove that in a tournament with 799 teams, there exist 14 teams, that can be partitioned into groups in a way that all of the teams in the first group have won all of the teams in the second group.