Degree-diameter problem $N(18,6)$
The largest possible number of vertices in a graph of maximum degree $18$ and diameter $6$.
Lower bound:
$4022340$
(4,022,340)
Upper bound:
Unknown