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)).
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.
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.