Hunting rabbits on the hypercube

DOI10.1016/j.disc.2018.10.011zbMath1400.05156arXiv1701.08726OpenAlexW2963460023WikidataQ128949439 ScholiaQ128949439MaRDI QIDQ1625793

Jessalyn Bolkema, Corbin Groothuis

Publication date: 29 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

isoperimetric inequalitieshypercubescops and robbers

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Unnamed Item
• Unnamed Item
• Odd and even Hamming spheres also have minimum boundary
• How to hunt an invisible rabbit on a graph
• Finding a princess in a palace: a pursuit-evasion problem
• An Isoperimetric Inequality on the Discrete Torus
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Hunting rabbits on the hypercube