Degree-diameter problem $N(6,8)$
The largest possible number of vertices in a graph of maximum degree $6$ and diameter $8$.
Lower bound:
$76891$
(76,891)
Upper bound:
Unknown
Updates
-
2008
Lower bound: $76461$
(76,461)
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] -
2024-06-27
Lower bound: $76891$
(76,891)
Comellas, F. (2024). Table of large graphs with given degree and diameter. arXiv preprint arXiv:2406.18994.
[via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]