Double-exponential lower bound conjecture for r_4(5,n)
Statement
Let be the off-diagonal Ramsey number for 4-uniform hypergraphs, the least such that every red-blue coloring of the 4-edges of an -vertex complete hypergraph contains a red copy of the complete 4-uniform hypergraph on 5 vertices or a blue copy on vertices. The lower-bound conjecture. For , there is an absolute constant such that
The conjecture would improve the best known lower bound for from a single exponential of the form to a double exponential. The source notes that this conjecture follows from the crucial diagonal conjecture for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.