ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an elementary polyomino, meaning a polyomino whose associated plane bipartite graph is elementary. The maximum forcing number conjecture. The maximum forcing number of GG can be computed in polynomial time.

This conjecture extends the polynomial-time result known for elementary hexagonal systems to elementary polyominoes. The paper's abstract indicates that it proves the claim, showing that the maximum forcing number of an elementary polyomino equals its Clar number and can therefore be computed in polynomial time.

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.