When does a random graph have constant cop number?

zbMATH Open1196.05089MaRDI QIDQ3565878FDOQ3565878

Authors: Paweł Prałat 

Publication date: 7 June 2010

Recommendations

• Cops and robbers in a random graph
• Chasing robbers on random graphs: zigzag theorem
• Chasing robbers on percolated random geometric graphs
• Chasing robbers on random geometric graphs-an alternative approach
• Cops and robbers on geometric graphs

zbMATH Keywords

random graphcops and robbersvertex pursuit gane

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cited In (29)

• The optimal capture time of the one-cop-moves game
• Vertex Pursuit Games in Stochastic Network Models
• Containment game played on random graphs: another zig-zag theorem
• Meyniel extremal families of abelian Cayley graphs
• Almost all cop-win graphs contain a universal vertex
• Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
• A tight lower bound for the capture time of the cops and robbers game
• Cops and robbers on graphs based on designs
• Throttling for the game of cops and robbers on graphs
• The cop density of a graph
• Fine-grained Lower Bounds on Cops and Robbers
• Chasing robbers on random graphs: zigzag theorem
• Pursuit-evasion in models of complex networks
• Cops and invisible robbers: the cost of drunkenness
• Some remarks on cops and drunk robbers
• Cops and robbers in a random graph
• Chasing robbers on random geometric graphs-an alternative approach
• The localization number of designs
• Lower bounds for the capture time: linear, quadratic, and beyond
• Cops and robbers on directed and undirected abelian Cayley graphs
• Chasing a fast robber on planar graphs and random graphs
• Meyniel's conjecture holds for random graphs
• A probabilistic version of the game of zombies and survivors on graphs
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Cops and Robbers on diameter two graphs
• Cops and robbers from a distance
• Cops that surround a robber
• Cops and Robber game with a fast robber on expander graphs and random graphs
• A note on cops and robbers, independence number, domination number and diameter

This page was built for publication: When does a random graph have constant cop number?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565878)