Graph Theory Seminar
Thursday, October 30, 2008 - 11:05am
1.5 hours (actually 80 minutes)
PLEASE NOTE UNUSUAL TIME
We will consider the problem of counting the number T(n,g) of cubic graphs with n edges on a surface of of genus g, and review was is known in the combinatorial community in the past 30 years, what was conjectured in physics 20 years ago, and what was proven last month in joint work with Thang Le and Marcos Marino, using the Riemann-Hilbert analysis of the Painleve equation. No knowledge of physics or analysis is required.