Snake-in-the-box $s(12)$

The length, in edges, of the longest induced path in the $12$-dimensional hypercube.

Lower bound: $1480$ Verified
Upper bound: Unknown

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