ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph and let AA be the achievement graph, with no precolored red or green edges, denoted by (G,A,{},{})(G,A,\{\},\{\}). Unrestricted graph Ramsey-game conjecture. Graph Ramsey games played on (G,A,{},{})(G,A,\{\},\{\}) are PSPACE{\bf PSPACE}-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 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.