The special-vertex shortest-path conjecture for Hanoi graphs
Statement
Let , let be an alphabet of letters, and let . For , consider vertices labeled and . A vertex on a path is special if its label has the form for some . Special-vertex conjecture. There is a shortest path with at least one special vertex on every path between vertices and with labels and . The statement is proved in the source for as a lemma, while the text conjectures that the same technique should apply more generally; the supplied parser gives no resolution evidence for the conjectural general statement.
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.