2008 PUMaC Combinatorics A9 / B10
Source:
October 4, 2019
combinatorics
Problem Statement
How many spanning trees does the following graph (with vertices and edges) have?
(A spanning tree is a subset of edges that spans all of the vertices of the original graph, but does not contain any cycles.)
https://cdn.artofproblemsolving.com/attachments/0/4/0e53e0fbb141b66a7b1c08696be2c5dfe68067.png