On the order of Erd\H{o}s-Rogers functions

TL;DR

None

Contribution

None

Abstract

For an integer $n \geq 1$, the Erd\H{o}s-Rogers function $f_{s}(n)$ is the maximum integer $m$ such that every $n$-vertex $K_{s+1}$-free graph has a $K_s$-free subgraph with $m$ vertices. It is known that for all $s \geq 3$, $f_{s}(n) = \Omega(\sqrt{n\log n}/\log \log n)$ as $n \rightarrow \infty$. In this paper, we show that for all $s \geq 3$, \begin{equation*} f_{s}(n) = O(\sqrt{n}\, \log n). \end{equation*} This improves previous bounds of order $\sqrt{n} (\log n)^{2(s + 1)^2}$ by Dudek, Retter and R\"{o}dl.