I have to admit that I am stumped. It has been a while since I took graph theory. Here's the problem:
"Prove: If a graph has e edges and v vertices, and e > or equal to v, then the graph must contain a cycle. Note that it does not matter if the graph is connected or not."
In fact, I like this problem so much and want to know it, that I'll award the first person who can solve it 3 Steem Dollars as long as this post is still open. (I know 3 is not a lot but I'm just a broke mathematician philosopher).
