Degree-diameter problem $N(16,5)$
The largest possible number of vertices in a graph of maximum degree $16$ and diameter $5$.
Lower bound:
$132496$
(132,496)
Upper bound:
Unknown