Proposition 4.1.8.

In any graph, the number of vertices with odd degree must be even.

Proof.

Suppose there were a graph with an odd number of vertices with odd degree. Then the sum of the degrees in the graph would be odd, which is impossible, by the handshake lemma.

in-context