The capture time of the hypercube

zbMath1266.05096arXiv1308.3354MaRDI QIDQ1953506

Paweł Prałat, Bill Kinnersley, Przemysław Gordinowicz, Anthony Bonato

Publication date: 7 June 2013

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

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

zbMATH Keywords

hypercubecops and robberscapture timecoupon-collector problem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (7)

Capture times in the bridge-burning cops and robbers game ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Conjectures on Cops and Robbers

Cites Work

• Unnamed Item
• Unnamed Item
• Cops and invisible robbers: the cost of drunkenness
• The capture time of grids
• A game of cops and robbers
• Cop-win graphs with maximum capture-time
• The capture time of a graph
• A game of cops and robbers played on products of graphs
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• Some remarks on cops and drunk robbers

This page was built for publication: The capture time of the hypercube