Cops and robbers in a random graph
From MaRDI portal
Publication:1945995
DOI10.1016/j.jctb.2012.10.002zbMath1261.05064arXiv0805.2709OpenAlexW2014824669MaRDI QIDQ1945995
Béla Bollobás, Imre Leader, Gábor Kun
Publication date: 17 April 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0805.2709
Random graphs (graph-theoretic aspects) (05C80) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
To catch a falling robber, Variations on cops and robbers, Subdivisions in the robber locating game, Cops and robbers from a distance, Chasing a Fast Robber on Planar Graphs and Random Graphs, The game of overprescribed Cops and Robbers played on graphs, An Introduction to Lazy Cops and Robbers on Graphs, Cops and invisible robbers: the cost of drunkenness, Some remarks on cops and drunk robbers, Cops and Robber game with a fast robber on expander graphs and random graphs, Cops and Robbers on Dynamic Graphs: Offline and Online Case, The node cop‐win reliability of unicyclic and bicyclic graphs, Meyniel's conjecture on graphs of bounded degree, On the cop number of graphs of high girth, Almost all cop-win graphs contain a universal vertex, To satisfy impatient web surfers is hard, Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\), Cops and Robbers on diameter two graphs, The robber locating game, The game of Cops and Robber on circulant graphs, Revolutionaries and Spies on Random Graphs, Meyniel's conjecture holds for random graphs, Search for an immobile hider on a stochastic network, Chasing robbers on random geometric graphs-an alternative approach, Conjectures on Cops and Robbers, Containment game played on random graphs: another zig-zag theorem, Meyniel extremal families of abelian Cayley graphs
