Problem of the Week
Hilton Memorial Lecture
The (unoriented) edge polytope of a graph G is the convex polytope whose vertices are the columns of the unoriented incidence matrix of G. Edge polytopes were introduced relatively recently, in two papers of 1998. They form a rich family of 0/1-polytopes with interesting random and extremal properties. I will present a paper by Tuan and Ziegler that explores these properties.