Degree-diameter problem $N(17,4)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $4$.
Lower bound:
$19040$
(19,040)
Upper bound:
Unknown