ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KkK_k and KnK_n be complete graphs, let ErE^r and EgE^g be precolored red and green edge sets, and let Ramsey(n,n)\mathrm{Ramsey}(n,n) denote the classic symmetric binary Ramsey number. Classic Ramsey-number avoidance conjecture. Graph Ramsey avoidance games played on (Kk,Kn,Er,Eg)(K_k,K_n,E^r,E^g) where k≥Ramsey(n,n)k\geq\mathrm{Ramsey}(n,n) are PSPACE{\bf PSPACE}-complete. The conjecture restricts avoidance games to complete host graphs whose order is at least the corresponding symmetric binary Ramsey number; the paper presents these games as difficult, but supplies no resolution of the conjecture.

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.