Nonexistence conjecture for primitive graphs with prime distance sequence
Statement
A primitive graph is a graph whose automorphism group acts primitively on its vertices, and its distance sequence records the distinct finite and infinite distances from a vertex. Let be a prime. Prime-distance nonexistence conjecture. There does not exist a primitive graph with distance sequence for primes . This conjecture is proposed as part of the classification of distance sequences for primitive graphs; its status is unresolved in the supplied source.
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.