University of Cambridge > > Combinatorics Seminar > Induced subgraphs of graphs with large chromatic number

Induced subgraphs of graphs with large chromatic number

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

  • UserAlex Scott (University of OXford)
  • ClockThursday 13 October 2016, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

What can we say about the induced subgraphs of a graph G with very large chromatic number? If G has no large cliques, then what else can we guarantee? We will discuss recent work on this topic, and present some new results. (Joint work with Maria Chudnovsky and Paul Seymour.)

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity