The coil-in-the-box problem asks for the longest induced cycle in the hypercube graph . A coil is an induced
cycle, so two nonconsecutive vertices of the
cycle cannot be adjacent in
.
Its length is its number of vertices (Östergård
and Pettersson 2014).
Let
be the maximum coil length. Byrnes et al. (2026) proved
for , where
is the floor function.
A second linear programming bound gives
where
denotes big-O notation. Together the bounds improve
the earlier upper bounds for every
.