Caleb Fong, Rutgers University

Abstract

Steinitz's theorem gives a neat characterisation for the graphs (1-skeleta) of 3-dimensional convex polytopes. In this talk, I will sketch one direction of the proof (using shadows), and give a rough idea for how the other direction goes. I will also mention the higher-dimensional Steinitz problem, and if time permits -- some connections with the Art Gallery Problem and complexity theory.