Accelerated Cops and Robbers
Abstract
We consider a variant of Cops and Robbers in which both the cops and the robber are allowed to traverse up to s edges on each of their turns, where s 2. We give several general for this new model as well as establish bounds for the cop numbers for grids and hypercubes. We also determine the capture time of cop-win graphs when s = 2 up to a small additive constant.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.