Degree-diameter problem $N(19,5)$
The largest possible number of vertices in a graph of maximum degree $19$ and diameter $5$.
Lower bound:
$221676$
(221,676)
Upper bound:
Unknown