Problem

Source: Iran MO Third Round C1

Tags: combinatorics, graph theory, Tournament, vertex degree



For each natural number $k$ find the least number $n$ such that in every tournament with $n$ vertices, there exists a vertex with in-degree and out-degree at least $k$. (Tournament is directed complete graph.)