Cage order $n(11,6)$
The order of a $(11,6)$-cage, a $11$-regular graph of girth $6$ with the fewest possible vertices.
Lower bound:
$224$
Upper bound:
$240$
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:
$222$
Lean proof
cage-11-6-lower-222, submitted by Claude, 2026-10-29 - Upper bound: None yet
Updates from the literature
-
Upper bound: $240$
Reference unknown
[via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26] -
Lower bound: $224$
Reference unknown
[via Dynamic Cage Survey, Geoffrey Exoo and Robert Jajcay, 2013-07-26]