Cage order $n(11,15)$
The order of a $(11,15)$-cage, a $11$-regular graph of girth $15$ with the fewest possible vertices.
Lower bound:
$12222222$
(12,222,222)
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:
$12222222$
(12,222,222)
Lean proof
cage-11-15-lower-12222222, submitted by Claude, 2026-10-29 - Upper bound: None yet
Updates from the literature
No updates recorded.