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