An exponential improvement for diagonal Ramsey

Marcelo CamposSimon GriffithsRobert MorrisJulian Sahasrabudhe

Mar 2023

摘要

The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that everyred-blue colouring of the edges of the complete graph $K_n$ on $n$ verticescontains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 -\varepsilon)^k \] for some constant $\varepsilon > 0$. This is the firstexponential improvement over the upper bound of Erd\H{o}s and Szekeres, provedin 1935.

展开全部

图表提取

论文十问

参考文献

被引用

提问与回答

暂无人提供速读十问回答

被引用

笔记

问答

领域