# Graph Theory Puzzle

Let $G$ be a graph with average degree $d$. Show that there exists a vertex $v \in V(G)$ such that the average degree of neighbours of $v$ is at least $d$.