My test today
I took a test today in my graph theory class. I thought it might be interesting to share one of the problems:
4. Prove by induction on the number of vertices in the graph (|V|) that every undirected graph G has an orientation such that |indeg(v) -outdeg(v)| <= 1 for every vertex in the graph.
I think I got it mostly right.
One of the things I love about math is taking a course and reading the last chapter the course will cover. Such gibberish. Yet, in just four or five months, it makes sense. You'd hardly even think it was the same book. So much fun!
And that's why I'm a grad student. I figured anybody who can say that with a straight face probably ought to keep going in their education.