When does a random graph have constant cop number?

In this paper, we study the vertex pursuit game of Cops and Robbers where cops try to capture a robber loose on the vertices of a graph. The minimum number of cops required to win on a given graph G is the cop number of G. We present asymptotic results for the game of Cops and Robbers played on a random graph G(n, p) focusing on the case when the cop number does not grow with the size of a graph. A few open problems are discussed.

[1]  Tomasz Łuczak,et al.  Chasing robbers on random graphs: Zigzag theorem , 2010 .

[2]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[3]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[4]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[5]  Anthony Bonato,et al.  Pursuit-Evasion in Models of Complex Networks , 2007, Internet Math..

[6]  Anthony Bonato,et al.  Vertex Pursuit Games in Stochastic Network Models , 2007, CAAN.

[7]  B. Intrigila,et al.  On the Cop Number of a Graph , 1993 .

[8]  Peter Frankl,et al.  Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..

[9]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[10]  J. Maynard.  On the difference between consecutive primes , 2012, 1201.1787.

[11]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[12]  Anant P. Godbole,et al.  On the Domination Number of a Random Graph , 2001, Electron. J. Comb..

[13]  Ehsan Chiniforooshan.  A better bound for the cop number of general graphs , 2008, J. Graph Theory.

[14]  Anthony Bonato,et al.  Cops and Robbers from a distance , 2010, Theor. Comput. Sci..

[15]  B. Alspach.  SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .

[16]  Tomasz Luczak,et al.  Chasing robbers on random graphs: Zigzag theorem , 2010, Random Struct. Algorithms.