Induced subgraphs and treewidth Speaker: Sophie Spirkl, University of Waterloo Abstract: Treewidth is a measure of the complexity of a graph and has both structural and algorithmic consequences. While results of Robertson and Seymour characterize which minors appear in graphs