PSPACE-completeness conjecture for symmetric binary graph Ramsey avoidance games
Statement
Let and be complete graphs, let and be precolored red and green edge sets, and let denote the classic symmetric binary Ramsey number. Classic Ramsey-number avoidance conjecture. Graph Ramsey avoidance games played on where are -complete. The conjecture restricts avoidance games to complete host graphs whose order is at least the corresponding symmetric binary Ramsey number; the paper presents these games as difficult, but supplies no resolution of the conjecture.
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.