Degree-diameter problem $N(11,8)$
The largest possible number of vertices in a graph of maximum degree $11$ and diameter $8$.
Lower bound:
$7442328$
(7,442,328)
Upper bound:
Unknown