Skip to main content Accessibility help
×
×
Home

Lower Bounds for the Cop Number when the Robber is Fast

  • ABBAS MEHRABIAN (a1)
Abstract

We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Ω(dt). By the known upper bounds on the order of cages, this implies that the cop number of a connected n-vertex graph can be as large as Ω(n2/3) if t ≥ 2, and Ω(n4/5) if t ≥ 4. This improves the Ω() lower bound of Frieze, Krivelevich and Loh (Variations on cops and robbers, J. Graph Theory, to appear) when 2 ≤ t ≤ 6. We also conjecture a general upper bound O(nt/t+1) for the cop number in this variant, generalizing Meyniel's conjecture.

Copyright
References
Hide All
[1]Alon, N. and Mehrabian, A. (2011) On a generalization of Meyniel's conjecture on the Cops and Robbers game. Electron. J. Combin. 18 #19.
[2]Araujo, G., González, D., Montellano-Ballesteros, J. J. and Serra, O. (2007) On upper bounds and connectivity of cages. Austral. J. Combin. 38 221228.
[3]Exoo, G. and Jajcay, R. (2008) Dynamic cage survey. Electron. J. Combin. 15 #16.
[4]Fomin, F. V., Golovach, P. A., Kratochvíl, J., Nisse, N. and Suchan, K. (2010) Pursuing a fast robber on a graph. Theoret. Comput. Sci. 411 11671181.
[5]Frankl, P. (1987) Cops and robbers in graphs with large girth and Cayley graphs. Discrete Appl. Math. 17 301305.
[6]Frieze, A., Krivelevich, M. and Loh, P. (2011) Variations on cops and robbers. J. Graph Theory, to appear.
[7]Hahn, G. (2007) Cops, robbers and graphs. Tatra Mt. Math. Publ. 36 163176.
[8]Lazebnik, F., Ustimenko, V. A. and Woldar, A. J. (1997) New upper bounds on the order of cages. Electron. J. Combin. 4 #13.
[9]Lu, L. and Peng, X. On Meyniel's conjecture of the cop number. Submitted.
[10]Nowakowski, R. and Winkler, P. (1983) Vertex-to-vertex pursuit in a graph. Discrete Math. 43 235239.
[11]Quilliot, A. (1978) Jeux et pointes fixes sur les graphes. PhD thesis, Université de Paris VI.
[12]Scott, A. and Sudakov, B. A new bound for the cops and robbers problem. arXiv:1004.2010v1 [math.CO].
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed