SE-SKOLORNAS 1976 Problem 1
In a tournament every team plays every other team just once. Each game is won by one of the teams (there are no draws). Each team loses at least once. Show that there must be three teams , , such that beat , beat and beat .
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.