- This event has passed.
Michael Savery, Induced subgraphs of induced subgraphs of large chromatic number
April 27 Wednesday @ 4:30 PM - 5:30 PM KST
We prove that for every graph F with at least one edge there are graphs H of arbitrarily large chromatic number and the same clique number as F such that every F-free induced subgraph of H has chromatic number at most c=c(F). (Here a graph is F-free if it does not contain an induced copy of F.) This generalises recent theorems of Briański, Davies and Walczak, and of Carbonero, Hompe, Moore and Spirkl. We further show an analogous statement where clique number is replaced by odd girth. This is joint work with Antonio Girão, Freddie Illingworth, Emil Powierski, Alex Scott, Youri Tamitegama and Jane Tan.