Ok, here's a proof of this theorem using the graphs:

Let

be an unweighted, undirected graph.

Lets look at the sum of the degrees of its vertices (I'll call it M, though it is often referred to as K):

Applying the double-counting, each edge

will be counted twice, once for each each vertex to which it is incident.

As a result, the sum MUST be twice the number of edges of G.

, which is even.

Now, all we do is take out the sum of all the degrees of vertices that are even to get the sum of all the odd degree vertices:

This result on the right hand side must still be even, since it is the difference of two even numbers.

Because the sum is of exclusively odd terms, then there must be an even number of them for the sum on the right side to be even, thus the desired result is achieved.