ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and write c⁡(G)\operatorname{c}(G) for its cop number and cc⁡(G)\operatorname{cc}(G) for its attacking cop number.

Strong attacking-cop-number conjecture. For all integers k≥4k \geq 4 there exists a graph HH such that c⁡(H)=k\operatorname{c}(H)=k and

cc⁡(H)=2c⁡(H).\operatorname{cc}(H)=2\operatorname{c}(H).

The conjecture asks whether the general upper bound cc⁡(G)≤2c⁡(G)\operatorname{cc}(G)\leq 2\operatorname{c}(G) is attained for every cop number at least four. The source states that its truth is unclear and that constructing examples with attacking cop number exceeding the cop number by at least two is nontrivial.

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.