Degree-diameter problem $N(13,7)$
The largest possible number of vertices in a graph of maximum degree $13$ and diameter $7$.
Lower bound:
$3322080$
(3,322,080)
Upper bound:
Unknown