On the expansion of Hanoi graphs.
D. Eppstein,
D. Frishberg, and
W. Maxwell.
arXiv:2510.18010
Discrete Mathematics & Theoretical Computer Science 28 (2): 31:1–31:18, 2026, doi:10.46298/dmtcs.16770.
In a previous paper, "On the treewidth of Hanoi graphs", we showed that \(n\)-disc \(p\)-peg Hanoi graphs have treewidth within a polynomial factor of \(n^{p-1}\). Here we consider expansion instead, and prove that both it and the treewidth are \(\Theta(n^{p-1})\).