A Journey of Balanced Separators: From Graph Minors to Induced Minors to Fat Minors
- Series
- Graph Theory Seminar
- Time
- Tuesday, December 8, 2026 - 15:45 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Hung Le – University of Massachusetts Amherst
Separator theorems are cornerstones of modern structural and algorithmic graph theory. Over the last few decades, researchers have developed various separator theorems for many different classes of graphs. The techniques underlying these results reveal deep and unexpected connections between different areas of math and computer science. In this talk, I will discuss a (biased) sample of a few separator theorems and sketch the techniques behind them.