Subdivisions in the Robber Locating Game
John Haslegrave, Richard A. B. Johnson, Sebastian Koch

TL;DR
This paper investigates a pursuit game on subdivided graphs, establishing the minimum path length needed for a cop to guarantee catching a robber, extending previous results from complete graphs to general graphs.
Contribution
The authors generalize the known bounds for the cop's winning strategy from complete graphs to all graphs, proving the bound is tight for most cases.
Findings
Cop wins on subdivided graphs if path length m ≥ n/2
Bound is tight for most graph sizes
Extended analysis to graphs with varying edge lengths
Abstract
We consider a game in which a cop searches for a moving robber on a graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any n-vertex graph there is a winning strategy for the cop on the graph obtained by replacing each edge of by a path of length , if . They conjectured that this bound was best possible for complete graphs, but the present authors showed that in fact the cop wins on if and only if , for all but a few small values of . In this paper we extend this result to general graphs by proving that the cop has a winning strategy on provided for all but a few small values of ; this bound is best possible. We also consider replacing the edges of with paths of varying lengths.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
