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