Prove that a connected graph with $n$ vertices is a tree iff it has $n-1$ edges.

153 Views Asked by At

What are different ways of proving this theorem, using different definitions for a tree (e.g. maximally acyclic graph, minimally connected graph, there's a unique path between any two vertices, etc.)