The classification conjecture for winning hat games on cycles with a vertex of hatness 2
Statement
Let be a cycle and let be a hat function such that for every vertex . Let be such that . The game is winning only in the following cases: ; there is one more vertex besides with hatness ; both neighbors of have hatness ; or one neighbor of and the vertex following that neighbor have hatness . The classification conjecture. These are the only cases in which the game 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.