Degree-diameter problem $N(13,5)$

The largest possible number of vertices in a graph of maximum degree $13$ and diameter $5$ .

Lower bound: $40488$ (40,488)
Upper bound: Unknown

Updates

2008 Lower bound: $40260$ (40,260)
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: $40488$ (40,488)
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]