An upper bound on the size of the snake-in-the-box (Q1382411): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on the size of the snake-in-the-box |
scientific article |
Statements
An upper bound on the size of the snake-in-the-box (English)
0 references
26 March 1998
0 references
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.
0 references
longest snake in the cube
0 references
