Degree-diameter problem $N(7,9)$
The largest possible number of vertices in a graph of maximum degree $7$ and diameter $9$.
Lower bound:
$1223050$
(1,223,050)
Upper bound:
Unknown