Prove that a graph with $n$ vertices and $m$ components and $n-m$ edges is a forest.
Using proof by contradiction, how would you go about this?
Prove that a graph with $n$ vertices and $m$ components and $n-m$ edges is a forest.
Using proof by contradiction, how would you go about this?