Kirchhoff Matrix-Tree Theorem

4 minute read

A spanning subgraph of a graph $X = (V, E)$ is a subgraph whose vertex set is exactly $V$, obtained by deleting some (possibly none) edges. A spanning tree o...