Caro–Petrusevski–Skrekovski–Tuza odd independence conjecture for Queen graphs
Statement
Let be the Queen graph on an 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 is odd independent if it is independent and every vertex in has either zero or an odd number of neighbors in . Writing for the maximum cardinality of an odd independent set in , the conjecture asserts that for every finite . For the infinite Queen graph, on the quarter-plane or the whole plane, the associated question asks whether or ; the claimed resolution is .
Record
- Added
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.