2000 character limit reached
The capture time of grids (1008.4424v2)
Published 26 Aug 2010 in math.CO
Abstract: We consider the game of Cops and Robber played on the Cartesian product of two trees. Assuming the players play perfectly, it is shown that if there are two cops in the game, then the length of the game (known as the 2-capture time of the graph) is equal to half the diameter of the graph. In particular, the 2-capture time of the m x n grid is proved to be floor ((m+n-2)/2).
Collections
Sign up for free to add this paper to one or more collections.