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