BIRS Workshop Lecture Videos
Holes in graphs of large chromatic number Scott, Alex
Let G be a graph with large chromatic number. What induced subgraphs must it contain? It may contain a large complete subgraph, but what can we say if this is not the case? We will survey recent work on this topic, concentrating on the question of finding induced cycles. In particular, we will discuss recent results with Paul Seymour, Maria Chudnovsky and Sophie Spirkl.
Item Citations and Data
Attribution-NonCommercial-NoDerivatives 4.0 International