Subfield: Combinatorics


Question: This Question involves one Robber and one or more Cops. After robbing a bank, the Robber retreats to a network of hideouts, represented by dots in the diagram below. Every day, the Robber stays holed up in a single hideout, and every night, the Robber moves to an adjacent hideout. Two hideouts are adjacent if and only if they are connected by an edge in the diagram, also called a hideout map (or map). For the purposes of this Power Question, the map must be connected; that is, given any two hideouts, there must be a path from one to the other. To clarify, the Robber may not stay in the same hideout for two consecutive days, although he may return to a hideout he has previously visited. For example, in the map below, if the Robber holes up in hideout $C$ for day 1 , then he would have to move to $B$ for day 2 , and would then have to move to either $A, C$, or $D$ on day 3.

![](https://cdn.mathpix.com/cropped/2023_12_21_279781de8be6584eef7dg-1.jpg?height=336&width=447&top_left_y=889&top_left_x=836)

Every day, each Cop searches one hideout: the Cops know the location of all hideouts and which hideouts are adjacent to which. Cops are thorough searchers, so if the Robber is present in the hideout searched, he is found and arrested. If the Robber is not present in the hideout searched, his location is not revealed. That is, the Cops only know that the Robber was not caught at any of the hideouts searched; they get no specific information (other than what they can derive by logic) about what hideout he was in. Cops are not constrained by edges on the map: a Cop may search any hideout on any day, regardless of whether it is adjacent to the hideout searched the previous day. A Cop may search the same hideout on consecutive days, and multiple Cops may search different hideouts on the same day. In the map above, a Cop could search $A$ on day 1 and day 2, and then search $C$ on day 3 .

The focus of this Power Question is to determine, given a hideout map and a fixed number of Cops, whether the Cops can be sure of catching the Robber within some time limit.

Map Notation: The following notation may be useful when writing your solutions. For a map $M$, let $h(M)$ be the number of hideouts and $e(M)$ be the number of edges in $M$. The safety of a hideout $H$ is the number of hideouts adjacent to $H$, and is denoted by $s(H)$.

The Cop number of a map $M$, denoted $C(M)$, is the minimum number of Cops required to guarantee that the Robber is caught.
If $\mathcal{K}_{n}$ is a map with $n$ hideouts in which every hideout is adjacent to every other hideout (also called the complete map on $n$ hideouts), determine $C\left(\mathcal{K}_{n}\right)$.

Solution:
First we prove that for all maps $M, C(M)<h(M)$.

Prove. Let $n=h(M)$. The following strategy will always catch a Robber within two days using $n-1$ Cops, which proves that $C(M) \leq n-1$. Choose any subset $\mathcal{S}$ of $n-1$ hideouts and position $n-1$ Cops at the hideouts of $\mathcal{S}$ for 2 days. If the Robber is not caught on the first day, he must have been at the hideout not in $\mathcal{S}$, and therefore must move to a hideout in $\mathcal{S}$ on the following day.

So $C\left(\mathcal{K}_{n}\right) \leq n-1$. It remains to show that $n-1$ is minimal. But the Robber always has $n-1$ choices of where to move the next day, so a strategy using less than $n-1$ Cops can never guarantee capture. Thus $C\left(\mathcal{K}_{n}\right)>n-2$.

Final answer: $C\left(\mathcal{K}_{n}\right)>n-2$