Abstract
By refining some details of the proof in the paper [1], a more precise bound is obtained for the length of an arbitrary snake in the n-dimensional unit cube.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. S. Snevily (1994) The snake-in-the-box problem: A new upper bound, Dis crete Math. 133, No. 1-3, 307–314.
F. I. Solov’ëva (1987) An upper bound on the length of a cycle in the n-di-mensional unit cube (in Russian), Metody Diskret. Anal. 45, 71–76.
A. A. Evdokimov and S. A. Malyugin (1987) The “snake-in-the-box” code and paths in a lattice on a torus (in Russian), Mathematics Today, Vishcha Shkola, Kiev, pp. 108–116.
K. Deimer (1985) A new upper bound for the length of snakes, Combinatorica 5, No. 2, 109–120.
H. L. Abbot and M. Katchalski (1991) On the construction of a snake in the box codes, Utilitas Math. 40, 97–116.
A. A. Evdokimov (1990) Embedding of chains and cycles in a hypercube. I (in Russian), Metody Diskret. Anal. 50, 10–25.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Emel′yanov, P.G. (1997). An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube. In: Operations Research and Discrete Analysis. Mathematics and Its Applications, vol 391. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5678-3_4
Download citation
DOI: https://doi.org/10.1007/978-94-011-5678-3_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6395-1
Online ISBN: 978-94-011-5678-3
eBook Packages: Springer Book Archive