2011 PUMaC Individual Finals B3
Source:
September 24, 2019
combinatorics
Problem Statement
In a -player tournament for , every player plays every other player exactly once. Find with proof the smallest value of such that it is possible that for any two players, there was a third player who beat both of them.