If a graph $G$ with $n\ge2$ vertices and $n-2$ edges does not contain any isolated vertices, show that at least two components of the graph are trees (with at least two vertices each).
We know that a graph is a tree iff it does not contain cycles and has $n-1$ edges. But how could we combine this to provide a solution for the above?