PSPACE-completeness conjecture for unrestricted graph Ramsey games
Statement
Let be a graph and let be the achievement graph, with no precolored red or green edges, denoted by . Unrestricted graph Ramsey-game conjecture. Graph Ramsey games played on are -complete. The conjecture concerns the complexity of deciding whether the first player has a forced win from the uncolored graph, which is not implied by PSPACE-completeness for arbitrary positions; tractable subcases provide contrary evidence for some restricted families.
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.