Comment on Open thread, Oct. 5 - Oct. 11, 2015

Wed, 07 Oct 2015 00:47:18 GMT

Thanks for the feedback. I think you can construct all graphs and use it to prove the theorem if you prove that you can add an arbitrary number of additional edges and nodes to an arbitrary graph and keep the sum of the degrees of all nodes even, instead of just one additional node and one additional edge. I also see what you mean about this:

I can't quite tell if you actually rely on that construction.

I think the inductive hypothesis in the rest of that paragraph might be enough, and I just wrote down how I intuitively visualized the proof before that without realizing that it wasn't necessary (nor sufficient, I now know) for the argument to carry through.

If you have an idea of how you would write the proof, I'd be interested in seeing it. I looked at the book and the proof is actually even less formal there.

Discuss