Graphs and Matroids Seminar - Sophie Spirkl and James Davies
Title: Two counterexamples related to chi-boundedness
Speaker: | Sophie Spirkl and James Davies |
Affiliation: | University of Waterloo |
Zoom: | Click here or please email Shayla Redlin |
Abstract:
This will be a joint talk with two parts.
Sophie Spirkl: I will present a counterexample to the following well-known conjecture: for every k, r, every graph G with clique number at most k and sufficiently large chromatic number contains a triangle-free induced subgraph with chromatic number at least r.