Cage order $n(3,6)$

Heawood graph

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

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

Updates from the literature