University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Stability results for graphs containing a critical edge

## Stability results for graphs containing a critical edgeAdd to your list(s) Download to your calendar using vCal - Alex Roberts (University of Oxford)
- Thursday 28 February 2019, 13:00-14:00
- Watson LTB.
If you have a question about this talk, please contact Richard Montgomery. 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 This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsType the title of a new list here Computer Science Distinguished Seminars Topology and Dynamics seminar## Other talksHow hard is LWE anyway? Weak universalities for some singular stochastic PDEs Fischer Groups RSC S F Boys-A Rahman Award Lecture Diagonal structures and primitive permutation groups The statistical era of strong gravitational lensing cosmology |