- Series
- Graph Theory Seminar
- Time
- Tuesday, March 15, 2022 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Joseph Briggs – Auburn University – jgb0059@auburn.edu – https://josephguybriggs.wordpress.com/
- Organizer
- Anton Bernshteyn
Suppose you have a subset $S$ of the vertices of a polytope which contains at least one vertex from every face. How large must $S$ be? We believe, in the worst case, about half of the number of vertices of the polytope. But we don’t really know why. We have found some situational evidence, but also some situational counter-evidence. This is based on joint work with Michael Dobbins and Seunghun Lee.