Discrete Applied MathematicsVolume 17, Issue 3, June 1987, Pages 301-305NoteCops and robbers in graphs with large girth and Cayley graphsAuthor links open overlay panelPeter FranklShow moreShareCitehttps://doi.org/10.1016/0166-218X(87)90033-3Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIt is shown that if a graph has girth at least 8t−3 and minimum degree greater that d, then more than dt cops are needed to catch a robber. Some upper bounds, in particular for Cayley graphs of groups, are also obtained.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1987 Published by Elsevier B.V.