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