Degree-diameter problem $N(9,8)$
The largest possible number of vertices in a graph of maximum degree $9$ and diameter $8$.
Lower bound:
$1697688$
(1,697,688)
Upper bound:
Unknown
Updates
-
2008
Lower bound: $1686600$
(1,686,600)
Loz, E., & Sirán, J. (2008). New record graphs in the degree-diameter problem. Australasian Journal of Combinatorics, 41, 63.
[via The Degree Diameter Problem for General Graphs - Combinatorics Wiki] -
2012-12-11
Lower bound: $1697688$
(1,697,688)
Canale, E., & Rodríguez, A. (2012). On the application of voltage graphs to the degree/diameter problem.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]