Accelerated Cops and Robbers
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908422361841664 |
|---|---|
| author | Kinnersley, William B. Townsend, Nikolas |
| author_facet | Kinnersley, William B. Townsend, Nikolas |
| contents | 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 \ge 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20753 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Accelerated Cops and Robbers Kinnersley, William B. Townsend, Nikolas Combinatorics Discrete Mathematics 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 \ge 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. |
| title | Accelerated Cops and Robbers |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2506.20753 |