Degree-diameter problem $N(9,9)$
The largest possible number of vertices in a graph of maximum degree $9$ and diameter $9$.
Lower bound:
$12123288$
(12,123,288)
Upper bound:
Unknown