University of Cambridge > Talks.cam > Combinatorics Seminar > The largest K_s-free induced subgraph in a K_t-free graph

The largest K_s-free induced subgraph in a K_t-free graph

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

  • UserOliver Janzer (University of Cambridge)
  • ClockThursday 01 November 2018, 14:30-15:30
  • HouseMR12.

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

The Erdős-Rogers function measures how large a K_s-free induced subgraph there must be in a K_t-free graph on n vertices. Good estimates are known when t=s+1, but in general there are significant gaps between the best known lower and upper bounds. We have improved the best known upper bound for s+2<=t<=2s-1. In this talk, I shall describe the construction, and sketch the proof that it has the required properties. This is joint work with Tim Gowers

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-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity