Mathematics

Tutte's theorem asserts that the number of directed spanning trees, rooted at a particular vertex of a directed graph, is equal to the determinant of an appropriate reduction of the Laplacian matrix associated to this graph. We will present a proof of this result that relies on a particular factorization of the Laplacian matrix.