Degree-diameter problem $N(20,6)$
The largest possible number of vertices in a graph of maximum degree $20$ and diameter $6$.
Lower bound:
$8947848$
(8,947,848)
Upper bound:
Unknown