On weak cop numbers of transitive graphs
Florian Lehner · Discrete Mathematics · 2025
The weak cop number of infinite graphs can be seen as a coarse-geometric analogue to the cop number of finite graphs. We show that every vertex transitive graph with at least one thick end has infinite weak cop number. It follows that every connected, vertex transitive graph has weak cop number 1 or ∞, answering a question posed by Lee, Martínez-Pedroza, and Rodríguez-Quinche, and reiterated in recent preprints by Appenzeller and Klinge, and by Esperet, Gahlawat, and Giocanti.