Degree-diameter problem $N(18,8)$
The largest possible number of vertices in a graph of maximum degree $18$ and diameter $8$.
Lower bound:
$323037476$
(323,037,476)
Upper bound:
Unknown