Conway’s 99-graph problem
Is there a graph on 99 vertices in which every two adjacent vertices have exactly one common neighbour and every two non-adjacent vertices have exactly two?
Summary
Such a graph would be strongly regular with parameters (99, 14, 1, 2); Norman Biggs suggested the possibility in 1969. John Conway had worked on the problem by 1975 and in 2014 offered a US$1,000 prize for its solution.
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.