Explain why it's impossible for the graph with degrees (n-2, n-1, ..., 1,0) when n is greater than or equal to 2 without using sequence algorithms
If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree?