Degree-diameter problem $N(9,3)$
The largest possible number of vertices in a graph of maximum degree $9$ and diameter $3$.
Lower bound:
$585$
Upper bound:
Unknown
The largest possible number of vertices in a graph of maximum degree $9$ and diameter $3$.
Lower bound:
$585$
Upper bound:
Unknown