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