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

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

• Oliver Janzer (University of Cambridge)
• Thursday 01 November 2018, 14:30-15:30
• MR12.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.