A connected undirected graph has 8 vertices and 12 edges. How many edges will its spanning tree contain?
Show Hint
If you ever see a graph with $n$ vertices and $n-1$ edges that is connected, it is a tree. If you add even one more edge, you create a cycle. If you remove even one edge, the graph becomes disconnected.