University of Cambridge > Talks.cam > Combinatorics Seminar > A Stability Theorem for Maximal K_{r+1}-free graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

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

Download to your calendar using vCal

  • UserRichard Snyder (University of Memphis)
  • ClockThursday 09 June 2016, 14:30-15:30
  • HouseMR12.

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

We prove a stability result for maximal Kr+1-free graphs. More precisely, let G be a maximal Kr+1-free graph whose number of edges is at most m away from the maximum possible in any Kr+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:

Note that ex-directory lists are not shown.

Other lists

Average on weekdays: 8967.86282051 kWh Keynes Room, Judge Business School, Cambridge Average on weekdays: 8927.41803279 kWh

Other talks

Group Work Title to be confirmed Differences between Robin and Neumann eigenvalues A Novel Diffusion Model based Approach for Sleep Music Generation Shining a light on the origin of supermassive black holes with cosmological simulations C2D3 Computational Biology Annual Symposium 2026
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity