Vesna Iršič Chenoweth: k-Hyperopic Cops and Robber

k-Hyperopic Cops and Robber

Vesna Iršič Chenoweth

Abstract: The k-hyperopic cops and robber game is a generalization of the hyperopic cops and robber, analogous to the k-visibility cops and robber. The game is defined similarly as the usual cops and robber game, but with the robber being omniscient and invisible to the cops that are at distance at most k away from the robber (i.e. cops are hyperopic or farsighted). The minimum number of cops needed to win the game on a graph is the k-hyperopic cop number. In this talk we will present some basic properties of the new game, provide a general upper bound and consider the game on trees and outerplanar graphs.

Joint work with Nicholas Crawford.