IrMO 2004 Problem 2
- Paper 1
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.
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.