Close the two-color hypergraph Ramsey gap

Determine the correct growth rate of the two-color Ramsey number of the k-uniform clique K_n^{(k)} for k ≥ 3 by closing the gap between the known lower bound tw_{k-1}(Ω_k(n^2)) and the known upper bound tw_k(O_2(n)).

Background

For k-uniform hypergraph cliques with k ≥ 3, the paper reports a stepping-up lower bound of tw_{k-1}(Ω_k(n2)) for two colors, while Erdős–Rado provide an upper bound of tw_k(O_2(n)). The authors note that the discrepancy between these bounds remains a major unresolved problem. This question concerns the classical dense hypergraph Ramsey setting and is distinct from the bounded-degree hypergraph constructions established in the paper.

References

Notably, for at least 4 colors, the lower bound matches the upper bound up to the constant on top of the tower, and it is a major open problem to close the gap for two colors.

— Lower bounds for Ramsey numbers of bounded degree hypergraphs  (2502.20863 - Bradač et al., 28 Feb 2025) in Section 1, Introduction

All the variations of the classical Ramsey theorem we have discussed so far equally make sense when extended to hypergraphs. We will refrain from giving any detailed presentation of these results, and will only mention that one of the main remaining open questions in this direction is to determine the correct tower-height of two-colour hypergraph Ramsey numbers.

— Sharp bounds for off-diagonal and tripartite canonical Ramsey numbers  (2610.03358 - Gvozdić et al., 2 Oct 2026) in Introduction, paragraph beginning “All the variations of the classical Ramsey theorem…”