Stumbled upon this question in a practice problem set:
Suppose graph $G$ is a forest with $n$ vertices, $m$ edges and $T$ trees. Express $m$ in terms of $n$ and $T$.
I know that a simple graph is $G=(V,E)$, but I don't know where to go from here.
Any tips would be appreciated!