





















We construct a 3-uniform 1-degenerate hypergraph on $n$ vertices whose 2-colour Ramsey number is $Ω\big(n^{3/2}/\log n\big)$. This shows that all remaining open cases of the hypergraph Burr-Erdős conjecture are false. Our graph is a variant of the celebrated hedgehog graph. We additionally show near-sharp upper bounds, proving that all 3-uniform generalised hedgehogs have 2-colour Ramsey number $O\big(n^{3/2}\big)$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。