tournament is arranged amongst a finite number of people
Source: 1954 Hungary - Kürschák Competition p3
October 10, 2022
combinatorics
Problem Statement
A tournament is arranged amongst a finite number of people. Every person plays every other person just once and each game results in a win to one of the players (there are no draws). Show that there must a person such that, given any other person in the tournament, either beat , or beat and beat for some .