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