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