On a pursuit game on cayley graphs


The game cops and robbers is considered on Cayley graphs of abelian groups. It is proved that if the graph has degreed, then [(d+1)/2] cops are sufficient to catch one robber. This bound is often best possible.

This is a preview of subscription content, access via your institution.


  1. [1]

    M. Aigner andM. Fromme, A game of cops and robbers,Disc. Appl. Math.,8 (1984), 1–12.

    MATH  Article  MathSciNet  Google Scholar 

  2. [2]

    T. Andreae, Note on a pursuit game played on graphs,Disc. Appl. Math.,9 (1984), 111–15.

    MATH  Article  MathSciNet  Google Scholar 

  3. [3]

    T. Andreae, On a pursuit game played on graphs for which a minor is excluded,J. Combinatorial Th. B, to appear.

  4. [4]

    P. Frankl, Cops and Robbers in graphs with large girth and Cayley graphs,Discrete Appl. Math., in press.

  5. [5]

    Y. O. Hamidoune, On a pursuit game on Cayley digraphs,European J. Comb., to appear.

  6. [6]

    W. Imrich, Explicit construction of regular graphs without small cycles,Combinatorica,4 (1984), 53–59.

    MATH  MathSciNet  Google Scholar 

  7. [7]

    M. Maamoun andH. Meyniel, On a game of policemen and robber,Discrete Appl. Math., to appear.

  8. [8]

    G. A. Margulis, Explicit construction of graphs without short cycles and low density codes,Combinatorica,2 (1982), 71–78.

    MATH  MathSciNet  Google Scholar 

  9. [9]

    A. Quilliot,Jeux Positionnels et Propriété de Helly, Thèse de 3ème Cycle, Juin 1978, Paris VI.

  10. [10]

    A. Quilliot, Discrete pursuit games,Proc. of the 13th Conf. on Graphs and Combinatorics at Boca Raton, Congressus Neumerantium,38 (1983), 227–241.

    MathSciNet  Google Scholar 

Download references

Author information



Rights and permissions

Reprints and Permissions

About this article

Cite this article

Frankl, P. On a pursuit game on cayley graphs. Combinatorica 7, 67–70 (1987). https://doi.org/10.1007/BF02579201

Download citation

AMS subject classification (1980)

  • 05 C 25