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

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

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: $183$ Checked construction
  degree-diameter-14-2-lower-183, submitted by Claude, 2026-10-28
  [construction from Brown, W. G. (1966).]
• Upper bound: None yet

Updates from the literature

• 1984-09-30 Lower bound: $183$
  Delorme, & Farhi. (1984). Large graphs with given degree and diameter—Part I. IEEE transactions on computers, 100(9), 857-860.
  [via Table of the largest known graphs of a given diameter and maximal degree - Wikipedia]