Degree-diameter problem $N(8,7)$
The largest possible number of vertices in a graph of maximum degree $8$ and diameter $7$.
Lower bound:
$131137$
(131,137)
Upper bound:
Unknown