Degree-diameter problem $N(17,5)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $5$.
Lower bound:
$133144$
(133,144)
Upper bound:
Unknown