An application of the Gyárfás path argument

03/04/2019

∙

by   Vaidy Sivaraman, et al.

∙

0

∙

share

We adapt the Gyárfás path argument to prove that t-2 cops can capture a robber, in at most t-1 moves, in the game of cops and robbers played in a graph that does not contain the t-vertex path as an induced subgraph.