Degree-diameter problem $N(7,10)$
The largest possible number of vertices in a graph of maximum degree $7$ and diameter $10$.
Lower bound:
$6007230$
(6,007,230)
Upper bound:
Unknown