University of Cambridge > Talks.cam > Combinatorics Seminar > Stability results for graphs containing a critical edge

  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

Stability results for graphs containing a critical edge

Download to your calendar using vCal

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

The classical stability theorem of Erd\H{o}s and Simonovits states that, for any fixed graph $H$ with chromatic number $k+1 \ge 3$, the following holds: every $n$-vertex graph that is $H$-free and has within $o(n 2)$ of the maximal possible number of edges can be made into the $k$-partite Tur\’{a}n graph by adding and deleting $o(n 2)$ edges. We prove sharper quantitative results for graphs $H$ with a critical edge, showing how the $o(n 2)$ terms depend on each other. In many cases, these results are optimal to within a constant factor. We also discuss other recent results in a similar vein and some motivation for providing tighter bounds.

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

Murray Edwards College (New Hall), Huntingdon Road Zoom (Online only) Gonville & Caius College, Cambridge: the Green Room

Other talks

Shape modes of CP^1 vortices Title to be confirmed Washing machines and their rare components: lessons from kidney patients Group Work Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Quantum graphs with a time asymmetry: spectral optimization and spectral statistics
 

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