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

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

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: $1$ Checked construction
  snake-in-the-box-1-lower-1, submitted by Claude, 2026-11-04
• Upper bound: None yet

Updates from the literature

• Lower bound: $1$
  Trivial or easy according to the secondary source.
  [via Sequence A099155 in the OEIS]
• Upper bound: $1$
  Trivial or easy according to the secondary source.
  [via Sequence A099155 in the OEIS]