Degree-diameter problem $N(4,8)$

The largest possible number of vertices in a graph of maximum degree $4$ and diameter at most $8$.

Verified bounds

Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.

• Lower bound: None yet
• Upper bound: None yet

Updates from the literature

• 2008 Lower bound: $3243$
  Loz, E., & Sirán, J. (2008). New record graphs in the degree-diameter problem. Australasian Journal of Combinatorics, 41, 63.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]