An application of the Gy\'{a}rf\'{a}s path argument

We adapt the Gy'{a}rf'{a}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.