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

From MaRDI portal
Revision as of 03:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references