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