An upper bound on the size of the snake-in-the-box (Q1382411)

The length of the longest snake (circuit) in the graph of the \(n\)-dimensional cube was known to be between \(c2^n\) and \(2^{n-1}(1-O(1/n))\). The upper bound is here improved to \(2^{n-1}(1-1/(89\sqrt n)+O(1/n))\). The problem has applications in coding theory.