Degree-diameter problem $N(12,7)$
The largest possible number of vertices in a graph of maximum degree $12$ and diameter $7$.
Lower bound:
$1999500$
(1,999,500)
Upper bound:
Unknown