A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

Add to your list(s) Download to your calendar using vCal

• Sophie Spirkl, University of Waterloo
• Thursday 31 March 2022, 15:00-16:00
• Via Zoom, but Poynting Large Lecture Theatre is also booked. Zoom link: https://bham-ac-uk.zoom.us/j/88168768618.

If you have a question about this talk, please contact Eoin Long.

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. Then I will discuss a related counterexample, due to Brianski, Davies, and Walczak, for another conjecture about graphs of large chromatic number. Joint work with Alvaro Carbonero, Patrick Hompe, and Benjamin Moore.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• School of Mathematics events
• Via Zoom, but Poynting Large Lecture Theatre is also booked. Zoom link: https://bham-ac-uk.zoom.us/j/88168768618

Note that ex-directory lists are not shown.