| Speaker: |
Jacques Verstraete |
| Affiliation: |
University of California |
| Location: |
MC 5501 |
Abstract: For positive integers $s$ and $n$, let $f_{s}(n)$ denote the maximum $k$ such that every $n$-vertex $K_{s+1}$-free graph contains an induced $K_s$-free subgraph with $k$ vertices. These are the Erd\H{o}s-Rogers functions, introduced by Erd\H{o}s and Rogers in 1962, and are generalizations of Ramsey numbers.
In this talk we survey recent progress, culminating with the recent result of Morris, Saharasbudhe which finally determines the order of magnitude of the Erd\H{o}s-Rogers functions.
Joint work with Rob Morris and Julian Saharasbudhe.