A quadratic-degree bound for minimal Ramsey graphs for cliques
Statement
Let denote the minimum number of edges in an -Ramsey-minimal graph for the clique . Quadratic-degree bound conjecture. For all and , there exist a constant and a constant-degree polynomial function such that
The conjecture asks for a substantially stronger bound than the preceding polynomial upper bounds, reducing the main dependence on and 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.