MathDB
The old problem of tournament - [Iran Second Round 1989]

Source:

December 6, 2010
combinatorics proposedcombinatorics

Problem Statement

In a sport competition, mm teams have participated. We know that each two teams have competed exactly one time and the result is winning a team and losing the other team (i.e. there is no equal result). Prove that there exists a team xx such that for each team y,y, either xx wins yy or there exists a team zz for which xx wins zz and zz wins y.y.
[i.e. prove that in every tournament there exists a king.]