Homework Help

Let G = (V, E) be a graph, and let v be a node in G with an odd number of neighbors. Prove that there is a node v' ≠ v in G such that v' also has an odd number of neighbors.