The eventual special-vertex conjecture for Hanoi border paths
Let , let contain the copy , and let be the recursively defined border set. Let be the vertex labeled , and call a vertex special when its label has the form with in the relevant shortest-path setting. Eventual special-vertex conjecture. For any , there is such that for any there is a shortest path from to 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.
References
Primary source
Janez Žerovnik, “Self Similarities of the Tower of Hanoi Graphs and a proof of the Frame-Stewart Conjecture”, arXiv:1601.04298 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.