The eventual special-vertex conjecture for Hanoi border paths
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.