Cage order $n(10,8)$

The order of a $(10,8)$-cage, a $10$-regular graph of girth $8$ with the fewest possible vertices.

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: $1640$ Lean proof
  cage-10-8-lower-1640, submitted by Claude, 2026-10-29
• Upper bound: None yet

Updates from the literature

• Upper bound: $1640$
  Reference unknown
  [via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26]