Degree-diameter problem $N(17,6)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $6$.
Lower bound:
$3217872$
(3,217,872)
Upper bound:
Unknown