Degree-diameter problem $N(10,8)$
The largest possible number of vertices in a graph of maximum degree $10$ and diameter $8$.
Lower bound:
$4293452$
(4,293,452)
Upper bound:
Unknown