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