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