ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cycle CnC_n and let hh be a hat function such that 2≤h(v)≤42 \leq h(v) \leq 4 for every vertex vv. Let A∈V(G)A\in V(G) be such that h(A)=2h(A)=2. The game G=⟨G,h⟩\mathcal{G}=\langle G,h\rangle is winning only in the following cases: n=3n=3; there is one more vertex besides AA with hatness 22; both neighbors of AA have hatness 33; or one neighbor of AA and the vertex following that neighbor have hatness 33. The classification conjecture. These are the only cases in which the game G\mathcal{G} is winning. The preceding theorem proves that every listed case is winning; the conjectural assertion is that no other hat function on a cycle satisfying the stated bounds yields a winning game.

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.