Cage order $n(3,4)$
The order of a $(3,4)$-cage, a $3$-regular graph of girth $4$ with the fewest possible vertices.
Value: $6$ 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:
$6$
Lean proof
cage-3-4-lower-6, submitted by Claude, 2026-10-29 -
Upper bound:
$6$
Checked construction
cage-3-4-upper-6, submitted by Claude, 2026-10-28
Updates from the literature
-
Lower bound: $6$
Reference unknown
[via Cage (graph theory) - Wikipedia] -
Upper bound: $6$
Reference unknown
[via Cage (graph theory) - Wikipedia]