ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r4(5,n)r_4(5,n) be the off-diagonal Ramsey number for 4-uniform hypergraphs, the least NN such that every red-blue coloring of the 4-edges of an NN-vertex complete hypergraph contains a red copy of the complete 4-uniform hypergraph on 5 vertices or a blue copy on nn vertices. The r4(5,n)r_4(5,n) lower-bound conjecture. For n≥5n\geq 5, there is an absolute constant c>0c>0 such that

r4(5,n)>22nc.r_4(5,n)>2^{2^{n^c}}.

The conjecture would improve the best known lower bound for r4(5,n)r_4(5,n) from a single exponential of the form 2nclog⁡log⁡n2^{n^{c\log\log n}} to a double exponential. The source notes that this conjecture follows from the crucial diagonal conjecture for r3(n,n)r_3(n,n) established earlier in the paper's discussion, but it remains unproved here.

Record

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.