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