- Series
- Graph Theory Seminar
- Time
- Tuesday, September 14, 2021 - 3:45pm for 1 hour (actually 50 minutes)
- Location
- ONLINE
- Speaker
- Sophie Spirkl – University of Waterloo – sspirkl@uwaterloo.ca – https://sites.google.com/site/sophiespirkl/
- Organizer
- Anton Bernshteyn
Treewidth, introduced by Robertson and Seymour in the graph minors series, is a fundamental measure of the complexity of a graph. While their results give an answer to the question, “what minors occur in graphs of large treewidth?,” the same question for induced subgraphs is still open. I will talk about some conjectures and recent results in this area. Joint work with Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Kristina Vuskovic.