On the Multi-Robber Damage Number

by   Miloš Stojaković, et al.
University of Novi Sad
TU Graz

We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximise the number of damaged vertices. For that game with one cop against s robbers a conjecture was made in <cit.> that the cop can save three vertices from being damaged as soon as the maximum degree of the base graph is at least s2 + 2. We are able to verify the conjecture and prove that it is tight once we add the assumption that the base graph is triangle-free. We also study the game without that assumption, disproving the conjecture in full generality and further attempting to locate the smallest maximum degree of a base graph which guarantees that the cop can save three vertices against s robbers. We show that this number if between 2s2 - 3 and 2s2 + 1.


page 1

page 2

page 3

page 4


The Burning Number Conjecture Holds Asymptotically

The burning number b(G) of a graph G is the smallest number of turns req...

The damage throttling number of a graph

The cop throttling number of a graph, introduced in 2018 by Breen et al....

The multi-robber damage number of a graph

In many variants of the game of Cops and Robbers on graphs, multiple cop...

An improved procedure for colouring graphs of bounded local density

We develop an improved bound for the chromatic number of graphs of maxim...

Meyniel's conjecture on graphs of bounded degree

The game of Cops and Robbers is a well known pursuit-evasion game played...

On guarding polygons with holes

There is an old conjecture by Shermer <cit.> that in a polygon with n ve...

An Upper Bound on the GKS Game via Max Bipartite Matching

The sensitivity conjecture is a longstanding conjecture concerning the r...

Please sign up or login with your details

Forgot password? Click here to reset