The distance-three vertex conjecture for Pythagorean walks
Statement
Let be the graph of Pythagorean walks, with distinguished vertex , and let graph distance be measured from . A vertex is a symmetric counterpart of a listed vertex if it is obtained by the symmetries of the graph used in the paper. Distance-three vertex conjecture. The only vertices at distance from are , , and their symmetric counterparts. The conjecture is motivated by a computer search covering all nodes with , where all non-trivial cases were found to have distance at most ; the existence of further vertices requiring distance or more therefore remains open.
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.