Maximal number of matches for the winner of the tournament.
Source:
February 19, 2011
combinatorics unsolvedcombinatorics
Problem Statement
In a tournament with participants, one match is played at a time, with the loser dropping out. In each match, the numbers of wins so far of the two participants differ by not more than . What is the maximal number of matches for the winner of the tournament?