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
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 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 and be respectively the number of wins and losses of the -th player. Prove that Proposed by Sung Yun Kim, South Korea