Degree-diameter problem $N(18,9)$
The largest possible number of vertices in a graph of maximum degree $18$ and diameter $9$.
Lower bound:
$5768971167$
(5,768,971,167)
Upper bound:
Unknown