Prove that every graph has an even number of vertices of odd degree.
By the handshaking lemma, sum of degrees is even, so odd-degree vertices pair up
It is not true for all graphs
By induction on the number of vertices
Only for planar graphs