Kirchhoff's matrix-tree theorem revisited

Series: 
Research Horizons Seminar
Wednesday, February 18, 2009 - 12:00
1 hour (actually 50 minutes)
Location: 
Skiles 255
,  
School of Mathematics, Georgia Tech
I will give a modern bijective proof of Kirchhoff's classical theorem relating the number of spanning trees in a graph to the Laplacian matrix of the graph. The proof will highlight some analogies between graph theory and algebraic geometry.