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