Induction · Hard problem

Induction on the number of vertices (remove a leaf) shows that every tree with $n$ vertices has $n - 1$ edges. A forest is a graph whose pieces are trees. A forest has $50$ vertices split among $7$ trees. How many edges does it have?