A tight lower bound for the capture time of the cops and robbers game (Q2196569): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3033047515 / rank | |||
Normal rank | |||
Revision as of 22:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound for the capture time of the cops and robbers game |
scientific article |
Statements
A tight lower bound for the capture time of the cops and robbers game (English)
0 references
3 September 2020
0 references
The authors answer on the negative to a question by \textit{A. Bonato} and \textit{R. J. Nowakowski} [The game of cops and robbers on graphs. Providence, RI: American Mathematical Society (AMS) (2011; Zbl 1298.91004)] on the impossibility of improving the known lower bound of the capture time in the \(k\)-cop-win graphs, \(k\geq 2\), pertaining to the game of cops and robbers. This is in sharp contrast with the \(k=1\) case.
0 references
lower bound
0 references
mobile agents
0 references
cops and robbers
0 references
