A Covering Pursuit Game

Add to your list(s) Download to your calendar using vCal

• Ben Gillott (Cambridge)
• Thursday 20 March 2025, 14:30-15:30
• MR12.

If you have a question about this talk, please contact ibl10.

In the `Covering’ game on a graph, a robber and a set of cops play alternately, with the cops each moving to a vertex at distance at most 1 from their current vertex and the robber moving to a vertex at distance at most 2 from his current vertex. The cops win if, after every one of their moves, there is always a cop at the same vertex as the robber. How few cops are needed? We investigate this problem for the two-dimensional grid. There are applications to the game of `Catching a Fast Robber’, and our work answers questions of Bollobas and Leader and of Balister, Bollobas, Narayanan and Shaw.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.