Improved bounds for the Erdős-Rogers function
The Erd\H{o}s-Rogers function $f_{s,t}$ measures how large a $K_s$-free
induced subgraph there must be in a $K_t$-free graph on $n$ vertices. While
good estimates for $f_{s,t}$ are known for some pairs $(s,t)$, notably...