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