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