This lecture covers the Matrix Tree Theorem, which states that the number of spanning trees in a connected graph is related to the eigenvalues of its Laplace matrix. It explains how to calculate the number of spanning trees using submatrices and provides examples and proofs.