ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QnQ_n be the Queen graph on an n×nn\times n chessboard: its vertices are the board squares, and two distinct vertices are adjacent if they lie in a common row, column, or diagonal. A set S⊆V(Qn)S\subseteq V(Q_n) is odd independent if it is independent and every vertex in V(Qn)∖SV(Q_n)\setminus S has either zero or an odd number of neighbors in SS. Writing αod(G)\alpha_{\mathrm{od}}(G) for the maximum cardinality of an odd independent set in GG, the conjecture asserts that αod(Qn)=1\alpha_{\mathrm{od}}(Q_n)=1 for every finite nn. For the infinite Queen graph, on the quarter-plane or the whole plane, the associated question asks whether αod=1\alpha_{\mathrm{od}}=1 or αod=∞\alpha_{\mathrm{od}}=\infty; the claimed resolution is αod=1\alpha_{\mathrm{od}}=1.

Record

Added
Links

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.