Existence of a Moore graph of degree 57
Is there a graph with 3,250 vertices, each of degree 57, in which any two vertices are at most two steps apart and no cycle is shorter than 5?
Summary
Hoffman and Singleton showed that a Moore graph of diameter 2 and girth 5 can only have degree 2, 3, 7 or 57, and graphs with the first three degrees exist. Whether one of degree 57 exists is open; such a graph could not be vertex-transitive.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.