This note goes over a theorem about spanning trees: A Connected Graph has a Spanning Tree.
Theorem
- All connected graph has a spanning tree.
Proof
We induct on the number of edges of a connected graph.
- Base Case: Assume we have a connected graph with 0 0 0 edge. The spanning tree of the graph is itself, a single vertex.
- Inductive Hypothesis: Assume for a connected graph with