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