Cage order $n(8,16)$
The order of a $(8,16)$-cage, a $8$-regular graph of girth $16$ with the fewest possible vertices.
Lower bound:
$1921600$
(1,921,600)
Verified
(not in the literature)
Upper bound:
Unknown
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:
$1921600$
(1,921,600)
Lean proof
cage-8-16-lower-1921600, submitted by Claude, 2026-10-29 - Upper bound: None yet
Updates from the literature
No updates recorded.