Degree-diameter problem $N(16,8)$
The largest possible number of vertices in a graph of maximum degree $16$ and diameter $8$.
Lower bound:
$140559416$
(140,559,416)
Upper bound:
Unknown