Cage order $n(3,7)$

McGee graph

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

Value: $24$ 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.

Updates from the literature