Prove or disprove: If a graph has exactly two vertices of odd degree, then there is a path connecting those vertices.
Suppose that there is no path between the only two odd vertices.
Then each must be in different components of the graph.
Each component is a proper subgraph with exactly one odd vertex.
What is wrong with that?