A Stability Theorem for Maximal K_{r+1}-free graphs

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

• Richard Snyder (University of Memphis)
• Thursday 09 June 2016, 14:30-15:30
• MR12.

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

We prove a stability result for maximal K_r+1-free graphs. More precisely, let G be a maximal K_r+1-free graph whose number of edges is at most m away from the maximum possible in any K_r+1-free graph. We determine a function f(n) such that if m=o(f(n)), then G necessarily contains an induced complete r-partite subgraph which nearly spans the entire vertex set. We also provide constructions showing that this function f is best possible. This work resolves questions of Tyomkyn and Uzzell.

Joint with Kamil Popielarz and Julian Sahasrabudhe.

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.