A tight lower bound for the capture time of the cops and robbers game (Q2196569)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7243137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight lower bound for the capture time of the cops and robbers game |
scientific article; zbMATH DE number 7243137 |
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
0.9353079199790956
0 references
0.8513147234916687
0 references
0.8287031650543213
0 references
0.8231486678123474
0 references
0.8208999633789062
0 references
