Show that every connected graph with n vertices has at least n-1 edges.
I thought of it like this. At minimum, for n connected vertices in a graph, v1 connects to v2, to v3, ... , to v(n-1) to vn. This is n-1 edges. Every set of connected vertices can reduce to this and any other edges are unnecessary to be connected.
