Tractability conjecture for graph Ramsey achievement games
Statement
Let be the complete graph on vertices, let be the achievement graph, and let and be the precolored red and green edge sets. Achievement-game tractability conjecture. Graph Ramsey achievement games played on are tractable. This conjecture is motivated by evidence of tractable subcases, although the paper does not establish tractability in the full stated setting.
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.