I'm trying to prove that a non-trivial simple graph must have at least one pair of vertices whose degrees are equal. But i have no idea where to start. All I know is that a simple graph has no self loops.
A simple graph has no multiple edges too. The answer to question is here :
http://www.mathhelpforum.com/math-he...tml#post560107