Fast robbers on abelian Cayley graphs and digraphs

Source abstract

We study the fast-robber version of the Cops and Robbers game on finite strongly connected abelian Cayley digraphs, including undirected Cayley graphs as the symmetric case. For bounded out-degree $D$ we show that $c_{1,\infty}(Γ)=O_D(n^{1-1/D})$, improving to $O_D(n^{1-2/D})$ in the undirected case. Further, we show uniform sublinear bounds in broader slowly growing degree regimes.