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