Michael Savery gave an online talk on finding a graph of huge chromatic number such that every induced subgraph of large chromatic number has an induced copy of a fixed subgraph at the Virtual Discrete Math Colloquium

On April 27, 2022, Michael Savery from the Oxford University gave an online talk at the Virtual Discrete Math Colloquium on finding a graph of huge chromatic number such that every induced subgraph of large chromatic number has an induced copy of a fixed subgraph at the Virtual Discrete Math Colloquium. The title of his talk was “Induced subgraphs of induced subgraphs of large chromatic number“.