ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G\mathcal{G} be the graph of Pythagorean walks, with distinguished vertex O(0,0)O(0,0), and let graph distance be measured from O(0,0)O(0,0). 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 33 from O(0,0)O(0,0) are (1,0)(1,0), (2,0)(2,0), (2,1)(2,1) and their symmetric counterparts. The conjecture is motivated by a computer search covering all nodes (g,h)(g,h) with 0≤g,h<40000\leq g,h<4000, where all non-trivial cases were found to have distance at most 22; the existence of further vertices requiring distance 33 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.