ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices, let AA be the achievement graph, and let ErE^r and EgE^g be the precolored red and green edge sets. Achievement-game tractability conjecture. Graph Ramsey achievement games played on (Kn,A,Er,Eg)(K_n,A,E^r,E^g) 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 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.