Degree-diameter problem $N(17,9)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $9$.
Lower bound:
$3372648954$
(3,372,648,954)
Upper bound:
Unknown