Speaker: Jesse Geneson
Title: Throttling adversaries on trees

Abstract:
For the cop versus robber game, the throttling number of a graph sums the number of cops with the capture time (allowing more cops than the minimal number that can win the graph). We discuss new bounds on throttling for trees, chordal graphs, and other families, as well as throttling for the cop versus gambler game.