You are not logged in |
The excluded grid theorem
- Speaker(s)
- Paweł Parys
- Affiliation
- Uniwersytet Warszawski
- Date
- April 13, 2011, 2:15 p.m.
- Room
- room 5870
- Seminar
- Seminar Automata Theory
I will present a proof of the excluded grid theorem of Robertson and Seymour: a graph has no large grid minor if and only if it has small tree-width.
