Containment game played on random graphs: another zig-zag theorem

zbMath1328.05122arXiv1505.01767MaRDI QIDQ2346471

Paweł Prałat

Publication date: 2 June 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.01767

zbMATH Keywords

random graphscops and robberscontainmentvertex-pursuit games

Mathematics Subject Classification ID

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

Related Items (4)

A probabilistic version of the game of zombies and survivors on graphs ⋮ Containment: a variation of cops and robber ⋮ Cops that surround a robber ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lazy cops and robbers played on random graphs and graphs on surfaces
• Cops and invisible robbers: the cost of drunkenness
• Cops and robbers from a distance
• Some remarks on cops and drunk robbers
• Cops and robbers in a random graph
• Containment: a variation of cops and robber
• Cops and robbers playing on edges
• On the Choice Number of Random Hypergraphs
• Variations on cops and robbers
• Chasing a Fast Robber on Planar Graphs and Random Graphs
• Chasing robbers on random graphs: Zigzag theorem
• Pursuit-Evasion in Models of Complex Networks
• Lazy Cops and Robbers on Hypercubes

This page was built for publication: Containment game played on random graphs: another zig-zag theorem