Let be a graph with average degree . Show that there exists a vertex such that the average degree of neighbours of is at least .
Follow Math Help Forum on Facebook and Google+
Does anyone have any ideas? Incidentally, there does not necessarily have to exist a vertex such that the average degree of neighbours is at most d, so I think there is at least something slightly subtle going on...