Catching a fast robber on the grid

Authors

Paul Balister, University of MemphisFollow
Amy Shaw, University of Memphis
Béla Bollobás, University of MemphisFollow
Bhargav Narayanan, Faculty of Mathematics

Abstract

We study the problem of cops and robbers on the grid where the robber is allowed to move faster than the cops. It is well known that two cops are necessary and sufficient to catch the robber on any finite grid when the robber has unit speed. Here, we prove that if the speed of the robber exceeds a sufficiently large absolute constant, then the number of cops needed to catch the robber on an n×n grid is exp⁡(Ω(log⁡n/log⁡log⁡n)).

Publication Title

Journal of Combinatorial Theory. Series A

Recommended Citation

Balister, P., Shaw, A., Bollobás, B., & Narayanan, B. (2017). Catching a fast robber on the grid. Journal of Combinatorial Theory. Series A, 152, 341-352. https://doi.org/10.1016/j.jcta.2017.06.009