Degree-diameter problem $N(11,7)$
The largest possible number of vertices in a graph of maximum degree $11$ and diameter $7$.
Lower bound:
$1001268$
(1,001,268)
Upper bound:
Unknown