Theoremadvanced
Kirchhoff's matrix-tree theorem
Also called Kirchhoff's theorem, Matrix-tree theorem, matrix-tree theorem.
The number of spanning trees equals any cofactor of the graph Laplacian.
The number of spanning trees equals any cofactor of the graph Laplacian.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag EB7F97 Edit this page History Report an error