Question 52
For all positive integers $k$ find the smallest positive integer $n$ such that for every tournament with $n$ vertices, there exists a vertex $v$ such that both *in-degree* and *out-degree* of $v$ are at least $k$. (A tournament is a directed graph such that there is exactly one edge between each of its two vertices).