Even flying cops should think ahead

  title={Even flying cops should think ahead},
  author={A. Martinsson and Florian Meier and P. Schnider and A. Steger},
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. 


A game of cops and robbers
It is shown that there are graphs on which arbitrarily many cops are needed to catch the robber and it is proved that for planar graphs 3 cops always suffice to win. Expand
Lazy Cops and Robbers played on random graphs and graphs on surfaces
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. The lazy cop number is the analogue of the usual cop number for thisExpand
Chasing a Fast Robber on Planar Graphs and Random Graphs
We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, that is, can take any path from her vertex in her turn, but she is not allowed to pass through a vertexExpand
Variations on cops and robbers
The directed graph version of the classical Cops and Robbers game is studied, and it is shown that the cop number of any strongly connected digraph on n vertices is O(n(loglogn)2/logn). Expand
Lazy Cops and Robbers played on Graphs
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which weExpand
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, is defined by way ofExpand
Cops and Robbers from a distance
It is proved that (nk)^1/^2^+^o^(^1^)@?c"k(n)=O(nlog(2nk+1)log(k+2)k-1), where c"k (n) is the maximum of c"K(G) over all n-vertex connected graphs. Expand
Vertex-to-vertex pursuit in a graph
This work characterize the graphs on which the cop has a winning strategy, and connects the problem with the structure theory of graphs based on products and retracts. Expand
Entanglement and the complexity of directed graphs
It is established that the complexity of solving a parity game can be parametrised in terms of the minimal entanglement of subgames induced by a winning strategy and one of the main results is that parity games of boundedEntanglement can be solved in polynomial time. Expand
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
The method determines the asymptotic distribution of the number of short cycles in graphs with a given degree sequence, and gives analogous formulae for hypergraphs. Expand