arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.05441math.CO
收藏

Erdős-Rogers $(s,s+2)$-问题的改进界

Improved bounds for the Erdős-Rogers $(s,s+2)$-problem

Oliver Janzer, Benny Sudakov

AI总结:

本文推广 Mattheus 和 Verstraëte 的方法,证明对任意 s≥2,Erdős-Rogers 函数 f_{s,s+2}(n) 的上界为 n^{(2s-3)/(4s-5)+o(1)},接近已知下界并改进大量先前结果。

摘要:

对于 $2\leq s<t$,Erdős-Rogers 函数 $f_{s,t}(n)$ 度量在 $n$ 个顶点的 $K_t$-free 图中必须存在的 $K_s$-free 诱导子图的大小。已有大量工作致力于估计该函数,但直到最近,只有 $t=s+1$ 的情形被充分理解。Mattheus 和 Verstraëte 关于 Ramsey 数 $r(4,k)$ 的近期突破表明 $f_{2,4}(n)\leq n^{1/3+o(1)}$,这与已知下界在 $o(1)$ 项内匹配。在本文中,我们基于他们的方法,通过证明对每个 $s\geq 2$ 有 $f_{s,s+2}(n)\leq n^{\frac{2s-3}{4s-5}+o(1)}$ 来推广这一结果。这接近最佳已知下界,改进了一大批相关工作,并且是任何类似构造所能给出的最佳结果。

英文摘要:

For $2\leq s<t$, the Erdős-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function, but until very recently only the case $t=s+1$ was well understood. A recent breakthrough of Mattheus and Verstraëte on the Ramsey number $r(4,k)$ states that $f_{2,4}(n)\leq n^{1/3+o(1)}$, which matches the known lower bound up to the $o(1)$ term. In this paper we build on their approach and generalize this result by proving that $f_{s,s+2}(n)\leq n^{\frac{2s-3}{4s-5}+o(1)}$ holds for every $s\geq 2$. This comes close to the best known lower bound, improves a substantial body of work and is the best that any construction of similar kind can give.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑