I am EXTREMELY confused on where to start with this problem. We recently just started learning about graph theory and I don't know where to begin.
Prove that in a connected graph G with $p$ vertices, $q$ edges, and at least one cycle, $q \ge p$
How do I begin with this question? Any help would be greatly appreciated. Thank you so much.