ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rr(n)R_r(n) denote the rr-uniform hypergraph Ramsey number: the minimal mm such that if we 22-colour all edges of the complete rr-uniform hypergraph on mm vertices then there must be some monochromatic copy of the complete rr-uniform hypergraph on nn vertices. Prove that, for r≥3r\geq 3, log⁡r−1Rr(n)≍rn,\log_{r-1} R_r(n) \asymp_r n, where log⁡r−1\log_{r-1} denotes the (r−1)(r-1)-fold iterated logarithm. That is, does Rr(n)R_r(n) grow like 22⋯n2^{2^{\cdots n}} where the tower of exponentials has height r−1r-1?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.