Degree-diameter problem $N(14,3)$

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

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: $791$ Checked construction
  degree-diameter-14-3-lower-791, submitted by Claude, 2026-11-02
• Upper bound: None yet

Updates from the literature

• 2001-05-25 Lower bound: $912$
  Exoo, G. (2001). A family of graphs and the degree/diameter problem. Journal of Graph Theory, 37(2), 118-124.
• 2008-06-03 Lower bound: $916$
  Gómez, J. (2009), Some new large (Δ, 3)-graphs. Networks, 53: 1-5.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]
• 2026-10-30 Lower bound: $1201$
  Rajiv, R. (2026). New lower bounds for the degree-diameter problem from Cayley graphs of metacyclic groups, slack filling and chart lifts. Zenodo.
  [via Comellas, F. The (Degree, Diameter) Problem for Graphs (records table), last changed November 2, 2026]