Cage order $n(11,12)$

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

Lower bound: $222222$ (222,222) Verified (not in the literature)
Upper bound: $319440$ (319,440)

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.

Updates from the literature