MathDB
Number of wins and losses of the ith player

Source: IMO Shortlist 2010, Combinatorics 5

July 17, 2011
combinatoricsIMO Shortlistgraph theoryTournament graphsvertex degreeHi

Problem Statement

n4n \geq 4 players participated in a tennis tournament. Any two players have played exactly one game, and there was no tie game. We call a company of four players badbad if one player was defeated by the other three players, and each of these three players won a game and lost another game among themselves. Suppose that there is no bad company in this tournament. Let wiw_i and lil_i be respectively the number of wins and losses of the ii-th player. Prove that i=1n(wili)30.\sum^n_{i=1} \left(w_i - l_i\right)^3 \geq 0.
Proposed by Sung Yun Kim, South Korea