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