The cop number
of a finite graph
is the least number of cops that can guarantee capture of
a robber in the following combinatorial game
(Nowakowski and Winkler 1983). The cops choose starting vertices,
then the robber chooses a starting graph vertex.
The players alternate turns, with the cops moving first. On a turn, each cop, or
the robber, may remain in place or move to an adjacent
vertex. Both sides know all positions, and capture occurs when a cop and the
robber occupy the same graph vertex. In the lazy
variant, at most one cop moves on each cop turn. Its minimum team size is the lazy
cop number
, which satisfies
.
Ghai (2026) proved
whenever a connected graph has a cyclic arrangement
of parts such that each part is dominated by a single graph
vertex and every graph edge joins the same part
or consecutive parts. The strategy uses two stationary cops to confine the robber
while a third moves the boundary inward. The result applies to flower
snarks. Ghai (2026) reports Claude assistance with proof strategies, computational
checks, and Lean formalization.