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