The eventual special-vertex conjecture for Hanoi border paths

From papers

Let p3p\geq 3, let Gn+1(p)G^{(p)}_{n+1} contain the copy AGn(p)AG^{(p)}_n, and let Sn0S_{n_0} be the recursively defined border set. Let aa be the vertex labeled An0+1A^{n_0+1}, and call a vertex special when its label has the form AniXiA^{n-i}X^i with XAp{A,B}X\in{\cal A}_p\setminus\{A,B\} in the relevant shortest-path setting. Eventual special-vertex conjecture. For any p3p\geq 3, there is n02n_0\geq 2 such that for any vSn0v\in S_{n_0} there is a shortest path from aa to vv that meets a special vertex. This is proposed as the inductive base needed for the partial proof of the special-vertex result; the supplied text gives no resolution evidence.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Janez Žerovnik, “Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture”, arXiv:1601.04298 (2016).

Solutions 0

No solutions have been posted yet.