Speaker: Prof. Igor Pak, UCLA

Title: How to prove Steinitz's theorem

Abstract: Steinitz's theorem is a classical but very remarkable result characterizing graphs of convex polytopes in R^3.  In this talk, I will first survey several known proofs, and present one that is especially simple. I will then discuss the quantitative version and recent advances in this direction. 

(Joint work with Stedman Wilson.)