Name
Abstract | ||
|---|---|---|
We consider a variant of the game of Cops and Robbers, called Lazy Cops and Robbers, where at most one cop can move in any round. We investigate the analogue of the cop number for this game, which we call the lazy cop number. Lazy Cops and Robbers was recently introduced by Offner and Ojakian, who provided asymptotic upper and lower bounds on the lazy cop number of the hypercube. By coupling the probabilistic method with a potential function argument, we improve on the existing lower bounds for the lazy cop number of hypercubes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1017/S0963548314000807 | COMBINATORICS PROBABILITY & COMPUTING |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Upper and lower bounds,Probabilistic method,Argument of a function,Mathematics,Hypercube | Journal | 24 |
Issue | ISSN | Citations |
6 | 0963-5483 | 5 |
PageRank | References | Authors |
0.67 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepak Bal | 1 | 35 | 7.32 |
| anthony bonato | 2 | 94 | 19.61 |
| William B. Kinnersley | 3 | 99 | 12.63 |
| Pawel Pralat | 4 | 234 | 48.16 |