Cage order $n(6,8)$
The order of a $(6,8)$-cage, a $6$-regular graph of girth $8$ with the fewest possible vertices.
Value: $312$ Verified lower bound Verified upper bound
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:
$312$
Lean proof
cage-6-8-lower-312, submitted by Claude, 2026-10-29 -
Upper bound:
$312$
Checked construction
cage-6-8-upper-312, submitted by Claude, 2026-10-28
Updates from the literature
-
Lower bound: $312$
Reference unknown
[via Cage (graph theory) - Wikipedia] -
Upper bound: $312$
Reference unknown
[via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26]