Hunting Rabbits on the Hypercube

Author
Bolkema, Jessalyn · Groothuis, Corbin
Year 2017
  See all Details

Abstract

We explore the Hunters and Rabbits game on the hypercube. In the process, we find the solution for all classes of graphs with an isoperimetric nesting property and find the exact hunter number of $Q^n$ to be $1+\sum\limits_{i=0}^{n-2} \binom{i}{\lfloor i/2 \rfloor}$. In addition, we extend results to the situation where we allow the rabbit to not move between shots.

Reviews

Write Review

Saving... Saving... Cancel Save Cancel

Details

Title
Hunting Rabbits on the Hypercube
Author
Bolkema, Jessalyn · Groothuis, Corbin
Year
2017
Type
Research Article
Language
eng
Comment
16 pages, pre-print
History
2017-01-30 00:00:00
Categories
Combinatorics
This is Version 1 of this record. We added this version on February 1, 2017. This version is based on an original data import from arXiv.org e-Print archive.