Degree-diameter problem $N(15,7)$
The largest possible number of vertices in a graph of maximum degree $15$ and diameter $7$.
Lower bound:
$8599986$
(8,599,986)
Upper bound:
Unknown