Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

A New Non-Asymptotic Upper Bound for Snake-in-the-Box Codes

A. Lukito1, A.J. van Zanten1
1Department of Mediamatics Delft University of Technology P.O. Box 5301, 2600 GA Delft, The Netherlands
  • Published: 30/11/2001

Abstract

A snake in a graph is a simple cycle without chords. A snake-in-the-box is a snake in the \(n\)-dimensional cube \(Q_n\). Combining the methods of G. Zemor (Combinatorica 17 (1997), 287-298) and of F.I. Solov’eva (Diskret Analiz. 45 (1987), 71-76) a new upper bound for the length of a snake-in-the-box is derived for \(16 \leq n \leq 19081\).

Citation
A. Lukito, A.J. van Zanten. A New Non-Asymptotic Upper Bound for Snake-in-the-Box Codes[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 039. 147-156. .