University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.