Degree-diameter problem $N(8,9)$
The largest possible number of vertices in a graph of maximum degree $8$ and diameter $9$.
Lower bound:
$4243100$
(4,243,100)
Upper bound:
Unknown