Even flying cops should think ahead
Discrete Mathematics
2018-01-23 v1
Abstract
We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to catch a robber in G, we show that the required number of cops can be much larger, even for graphs with small maximum degree. In particular, we show that there are 3-regular graphs where a linear number of cops are needed.
Keywords
Cite
@article{arxiv.1801.07193,
title = {Even flying cops should think ahead},
author = {Anders Martinsson and Florian Meier and Patrick Schnider and Angelika Steger},
journal= {arXiv preprint arXiv:1801.07193},
year = {2018}
}