ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, let Ramsey(n,n)\mathrm{Ramsey}(n,n) be the symmetric binary Ramsey number, and let KRamsey(n,n)K_{\mathrm{Ramsey}(n,n)} be the complete graph on that many vertices. Explicit-Ramsey-number avoidance conjecture. The graph Ramsey avoidance games played on (KRamsey(n,n),Kn,{},{})(K_{\mathrm{Ramsey}(n,n)},K_n,\{\},\{\}) are 22-EXPSPACE{\bf EXPSPACE}-complete. This conjecture is presented as a consequence of the preceding conjectures: computing explicit Ramsey numbers and manipulating graphs of their size suggests doubly exponential space requirements under succinct input representations.

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.