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