On the cop number of graphs of high girth

  title={On the cop number of graphs of high girth},
  author={Peter Bradshaw and Seyyed Aliasghar Hosseini and Bojan Mohar and Ladislav Stacho},
  journal={Journal of Graph Theory},
  pages={15 - 34}
We establish a lower bound for the cop number of graphs of high girth in terms of the minimum degree, and more generally, in terms of a certain growth condition. We show, in particular, that the cop number of any graph with girth g $g$ and minimum degree δ $\delta $ is at least 1 g ( δ − 1 ) ⌊ g − 1 4 ⌋ $\frac{1}{g}{(\delta -1)}^{\lfloor \frac{g-1}{4}\rfloor }$ . We establish similar results for directed graphs. While exposing several reasons for conjecturing that the exponent 1 4 g $\frac{1}{4… 

Meyniel's conjecture on graphs of bounded degree

It is proved that there are arbitrarily large subcubic graphs $G$ whose cop number is at least $n^{1/2-o(1)}$ where $n=|V(G)$ and it is shown that proving Meyniel's conjecture for graphs of bounded degree implies a weak Meynels' conjecture for all graphs.

4-cop-win Graphs Have at Least 19 Vertices

The Game of Cops and Robber on (Claw, Even-hole)-free Graphs

It is proved that the cop number of all claw-free even-hole-free graphs is at most two and, in addition, the capture time is at least 2n rounds, where n is the number of vertices of the graph.

A simple method for proving lower bounds in the zero-visibility cops and robber game

Cops and Robbers is a classical pursuit and evasion game in graph theory, which was introduced by Nowakowski and Winkler and independently by Quilliot. In this paper, we study the zero-visibility

Cops and robbers on Cayley graphs and embedded graphs

We consider the game of cops and robbers, which is a game played on a finite graph G by two players, Alice and Bob. Alice controls a team of cops, and Bob controls a robber, both of which occupy



Bounding the Cop Number of a Graph by Its Genus

The first improvement to Schroder's bound on cop number of a connected graph is given, showing that c(G) is bounded as a function of the genus of the graph g(G).

Meyniel's conjecture holds for random graphs

This paper improves upon existing results showing that asymptotically almost surely the cop number of Gn,p is Onlogn provided that pni¾?2+elogn for some e>0.3, and shows that Meyniel's conjecture holds asymptic almost surely for the binomial random graph Gn, p.

Meyniel's conjecture holds for random d‐regular graphs

A deterministic result is used to show that Meyniel's conjecture holds asymptotically almost surely for random $d$-regular graphs when $d = d(n) \ge 3$.

Meyniel Extremal Families of Abelian Cayley Graphs

We study the game of Cops and Robbers, where cops try to capture a robber on the vertices of a graph. Meyniel’s conjecture states that for every connected graph G on n vertices, the cop number of G

Cops and robbers in a random graph

Isoperimetric numbers of graphs

  • B. Mohar
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1989

On Meyniel's conjecture of the cop number

This article proves Meyniel's conjecture in special cases that G has diameter 2 or G is a bipartite graph of diameter 3, improving the best previously known upper-bound O(n/ lnn) due to Chiniforooshan.

A Bound for the Cops and Robbers Problem

Improving several previous results, it is proved that the cop number of an n-vertex graph is at most n2 −ð1 þoð1ÞÞ ffiffiffiffIFFiffiffiffsiffiffi log n p .

On a pursuit game played on graphs for which a minor is excluded

Cops and robbers in graphs with large girth and Cayley graphs