Degree-diameter problem $N(17,8)$
The largest possible number of vertices in a graph of maximum degree $17$ and diameter $8$.
Lower bound:
$220990700$
(220,990,700)
Upper bound:
Unknown