Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, March 08, 2018, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Florian Meier
We study the following version of cops and robbers, called the entanglement game, on sparse directed and undirected graphs. First, the robber chooses a starting position and the k cops are outside the graph. In every turn, the cops can either stay where they are, or they can fly one of them to the current position of the robber. Regardless of whether the cops stayed or one of them flew to the location of the robber, the robber then has to move to a neighbor of his current position that is not occupied by a cop. If there is no such neighbor, the cops win. The robber wins if he can run away from the cops indefinitely. While the minimum degree of a graph G is a trivial lower bound for the number of cops needed to catch a robber in G, we show that the required number of cops can be much larger, even for graphs with small maximum degree. In particular, we show that there are 3-regular graphs where a linear number of cops are needed. The presented results are joint work with Anders, Patrick and Angelika.
Automatic MiSe System Software Version 1.4803M | admin login