Degree-diameter problem $N(3,7)$
The largest possible number of vertices in a graph of maximum degree $3$ and diameter $7$.
Lower bound:
$196$
Upper bound:
Unknown
Updates
-
2001-05-25
Lower bound: $190$
Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal of Graph Theory, 37(2), 118-124. -
2001-06
Lower bound: $196$
Geoffrey Exoo, after May 2001 (i.e. after https://doi.org/10.1002/jgt.1007)
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]