Lazy Cops and Robbers on Hypercubes
Document Type
Article
Publication Date
11-1-2015
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.
DOI
10.1017/S0963548314000807
MSU Digital Commons Citation
Bal, Deepak; Bonato, Anthony; Kinnersley, William B.; and PraŁat, PaweŁ, "Lazy Cops and Robbers on Hypercubes" (2015). Department of Mathematics Facuty Scholarship and Creative Works. 100.
https://digitalcommons.montclair.edu/mathsci-facpubs/100