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