Conjecture on the cop number of fast robbers on grids
Statement
For , let be the minimum number of cops needed to catch a robber of speed on an grid, where the cops move at unit speed. Here “sufficiently large” refers to the robber speed parameter .
Fast-robber grid conjecture. For all sufficiently large ,
The conjecture says that, for sufficiently large fixed robber speeds, the trivial upper bound is asymptotically close to the truth. The paper proves a much weaker exponential lower bound for one sufficiently large speed and leaves this near-linear behaviour conjectural.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.