加载中…
Let be the two-colour Ramsey number of a graph . In this note, we prove that for any non-decreasing function , there exists a sequence of connected graphs , with for all , such that . In contrast, we also show that an analogous statement does not hold for hypergraphs of uniformity at least . We also use our techniques to answer a question posed by DeBiasio about the existence of sequences of graphs whose -colour Ramsey number is linear whereas their -colour Ramsey number has superlinear growth.

生成讲解博客的中文版本

生成AI智能校验的中文版本