PSPACE-completeness conjecture for Fast-Strategy on bipartite graphs
Statement
Let be a bipartite graph, and let denote the number of guards in the eternal domination game. The decision problem asks whether the guards have a strategy satisfying the fast-winning condition on . Fast-Strategy conjecture. The problem is PSPACE-complete on bipartite graphs. This conjecture is motivated by the PSPACE-hardness results for related graph classes and by the frequent dichotomy between polynomial-time solvability and PSPACE-hardness in game problems; the completeness of Fast-Strategy on bipartite graphs remains open.
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.