2000 character limit reached
An application of the Gyárfás path argument
Published 4 Mar 2019 in math.CO and cs.DM | (1903.01338v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.