Degree-diameter problem $N(11,6)$
The largest possible number of vertices in a graph of maximum degree $11$ and diameter $6$.
Lower bound:
$156864$
(156,864)
Upper bound:
Unknown
Updates
-
1985
Lower bound: $156864$
(156,864)
Gómez, José; Fiol, Miquel (1985), Dense compound graphs, Ars Combinatoria, 20: 211-237
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]