A Beginner's Guide to Counting Spanning Trees in a Graph

TL;DR

This paper provides an accessible, detailed proof of Kirchhoff's Matrix-Tree theorem, connecting linear algebra concepts with graph theory to make the classical result understandable for beginners and intermediates.

Contribution

It offers a comprehensive, step-by-step proof of the theorem, making a historically significant and elegant result more accessible to learners.

Findings

Proof of Kirchhoff's Matrix-Tree theorem presented

Clarification of linear algebra concepts related to graph theory

Enhanced understanding of the relationship between eigenvalues and spanning trees

Abstract

(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix. This is a 165 year old result in graph theory and the proof is conceptually simple. However, the elegance of this result is it connects many apparently unrelated concepts in linear algebra and graph theory. Our motivation behind this work was to make the proof accessible to anyone with beginner\slash intermediate grasp of linear algebra. Therefore in this paper we present proof of every single argument leading to the final result. For example, we prove the elementary properties of determinants, relationship between the roots of characteristic polynomial (that is, eigenvalues) and the minors, the Cauchy-Binet formula, the Laplace expansion of determinant, etc.