ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let sr(Kk)s_r(K_k) denote the minimum number of edges in an rr-Ramsey-minimal graph for the clique KkK_k. Quadratic-degree bound conjecture. For all r⩾2r\geqslant 2 and k⩾2k\geqslant 2, there exist a constant C>0C>0 and a constant-degree polynomial function ff such that

sr(Kk)⩽Ck2r2f(ln⁡k,ln⁡r).s_r(K_k) \leqslant C k^2 r^2 f(\ln k,\ln r).

The conjecture asks for a substantially stronger bound than the preceding polynomial upper bounds, reducing the main dependence on kk and rr to quadratic factors up to polylogarithmic terms. The source does not indicate that this conjecture has been resolved.

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.