论文信息 - Chasing robbers on random graphs: Zigzag theorem

Chasing robbers on random graphs: Zigzag theorem

In this paper, we study the vertex pursuit game of Cops and Robbers where cops try to capture a robber on the vertices of the 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 Robber played on a random graph G(n,p) for a wide range of p = p(n). It has been shown that the cop number as a function of an average degree forms an intriguing zigzag shape. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010 Supported by the Foundation for Polish Science.

Tomasz Łuczak | P. Prałat

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

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

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

[4] Van H. Vu,et al. A Large Deviation Result on the Number of Small Subgraphs of a Random Graph , 2001, Combinatorics, Probability and Computing.

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

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

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

[8] E. Chiniforooshan. A better bound for the cop number of general graphs , 2008 .

[9] Dimitrios M. Thilikos,et al. An annotated bibliography on guaranteed graph searching , 2008, Theor. Comput. Sci..

[10] Pawel Pralat. When does a random graph have constant cop number? , 2010, Australas. J Comb..