Degree-diameter problem $N(11,9)$
The largest possible number of vertices in a graph of maximum degree $11$ and diameter $9$.
Lower bound:
$72933102$
(72,933,102)
Upper bound:
Unknown