ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A planar graph is a graph admitting a planar embedding. For a graph GG, let c⁡(G)\operatorname{c}(G) denote its cop number and let cc⁡(G)\operatorname{cc}(G) denote its attacking cop number.

Planar attacking cop number conjecture. For every planar graph GG,

cc⁡(G)≤c⁡(G)+1.\operatorname{cc}(G) \leq \operatorname{c}(G)+1.

The conjecture would imply that all planar graphs have attacking cop number at most 44 once combined with the paper's established bounds. The source gives no resolution of this conjecture.

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.