ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let rKs(t1,t2)r_{K_s}(t_1,t_2) denote the minimum number of copies of KsK_s in a graph that is (t1,t2)(t_1,t_2)-Ramsey. Let r(t1,t2)r(t_1,t_2) be the Ramsey number, the smallest nn such that KnK_n is (t1,t2)(t_1,t_2)-Ramsey. Off-diagonal FF-Ramsey conjecture. For all positive integers s,t1,t2s,t_1,t_2 satisfying s≤max⁡(t1,t2)s\leq\max(t_1,t_2),

rKs(t1,t2)=(r(t1,t2)s).r_{K_s}(t_1,t_2)=\binom{r(t_1,t_2)}{s}.

This is the natural off-diagonal extension of the diagonal conjecture. The paper establishes the equality up to a lower-order term in the exponent when t1t_1 is 33 or 44, using constructions related to the asymptotics of r(4,t)r(4,t); the full equality remains open.

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.