2-EXPSPACE-completeness conjecture for Ramsey-number avoidance games
Statement
Let be the complete graph on vertices, let be the symmetric binary Ramsey number, and let be the complete graph on that many vertices. Explicit-Ramsey-number avoidance conjecture. The graph Ramsey avoidance games played on are --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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.