Degree-diameter problem $N(17,7)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $7$.
Lower bound:
$18495162$
(18,495,162)
Upper bound:
Unknown