On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game
نویسندگان
چکیده
We consider a variant of the Cops and Robbers game where the robber can move s edges at a time, and show that in this variant, the cop number of a connected graph on n vertices can be as large as Ω(n s s+1 ). This improves the Ω(n s−3 s−2 ) lower bound of Frieze et al. [5], and extends the result of the second author [10], which establishes the above bound for s = 2, 4.
منابع مشابه
Cops and Robbers on diameter two graphs
In this short paper we study the game of Cops and Robbers, played on the vertices of some fixed graph G of order n. The minimum number of cops required to capture a robber is called the cop number of G. We show that the cop number of graphs of diameter 2 is at most √ 2n, improving a recent result of Lu and Peng by a constant factor. We conjecture that this bound is still not optimal, and obtain...
متن کاملSelfish Cops and Adversarial Robber: Multi-Player Pursuit Evasion on Graphs
We introduce and study the game of " Selfish Cops and Adversarial Robber " (SCAR) which is an N-player generalization of the " classic " two-player cops and robbers (CR) game. We prove that SCAR has a Nash equilibrium in deterministic strategies.
متن کاملCatch Me If You Can: Cops and Robbers on Graphs
Vertex pursuit games are widely studied by both graph theorists and computer scientists. Cops and Robbers is a vertex pursuit game played on a graph, where some set of agents (or Cops) attempts to capture a robber. The cop number is the minimum number of cops needed to win. While cop number of a graph has been studied for over 25 years, it is not well understood, and has few connections with ex...
متن کاملThe game of Overprescribed Cops and Robbers played on graphs
We consider the effect on the length of the game of Cops and Robbers when more cops are added to the game play. In Overprescribed Cops and Robbers, as more cops are added, the capture time (the minimum length of the game assuming optimal play) monotonically decreases. We give the full range of capture times for any number of cops on trees, and classify the capture time for an asymptotic number ...
متن کاملThe Cop Number of the One-Cop-Moves Game on Planar Graphs
Cops and robbers is a vertex-pursuit game played on graphs. In the classical cops-and-robbers game, a set of cops and a robber occupy the vertices of the graph and move alternately along the graph’s edges with perfect information about each other’s positions. If a cop eventually occupies the same vertex as the robber, then the cops win; the robber wins if she can indefinitely evade capture. Aig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011