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