On the expansion of Hanoi graphs

David Eppstein, Daniel Frishberg, William Maxwell

The famous Tower of Hanoi puzzle involves moving $n$ discs of distinct sizes from one of $p\ge 3$ pegs (traditionally $p=3$) to another of the pegs, subject to the constraints tha…