Degree-diameter problem $N(18,7)$
The largest possible number of vertices in a graph of maximum degree $18$ and diameter $7$.
Lower bound:
$26515120$
(26,515,120)
Upper bound:
Unknown