University of Cambridge > Talks.cam > Combinatorics Seminar > A Covering Pursuit Game

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

A Covering Pursuit Game

Download to your calendar using vCal

  • UserBen Gillott (Cambridge)
  • ClockThursday 20 March 2025, 14:30-15:30
  • HouseMR12.

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

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:

Note that ex-directory lists are not shown.

Other lists

FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Webinar & FW11, Computer Laboratory, William Gates Building. Robinson College

Other talks

Christmas Social Evening & Annual General Meeting Title to be confirmed Group Work Pollution in Helmholtz boundary integral methods Tea and Coffee Break Online Causal Inference Seminar
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity