ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a gameboard be a graph on which the Game of Cycles is played, and let its total number of edges be the number of edges in the graph. Assume that no vertex of the gameboard has degree 11.

Parity conjecture. Player 1 has a winning strategy when the gameboard has an odd number of total edges, and Player 2 has a winning strategy when it has an even number of total edges.

This modifies the parity conjecture of Alvarado et al. by excluding gameboards with degree-one vertices, in response to the counterexample described in the paper. The parser marks this candidate as disproved; the displayed counterexample shows that the unrestricted parity principle fails, but the supplied evidence does not establish whether this restricted formulation itself has been disproved.

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.