On the order of Erdős-Rogers functions

Abstract

For an integer $n \geq 1$, the Erdő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) = Ω(\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ödl.

Theorems & Definitions (13)

• Theorem 1
• Proposition 1
• Proposition 2
• Proposition 3
• Definition 1
• Lemma 1
• proof
• Lemma 2
• proof
• Lemma 3