Journal of Combinatorial Theory, Series BVolume 45, Issue 1, August 1988, Pages 13-24On the snake in the box problemAuthor links open overlay panelH.L Abbott, M KatchalskiShow moreShareCitehttps://doi.org/10.1016/0095-8956(88)90051-2Get rights and contentUnder an Elsevier user licenseopen archiveAbstractA snake in a graph is a simple cycle without chords. Denote by s(d) the length of a longest snake in the d-dimensional unit cube. We give a new proof of the theorem of Evdokimov that s(d) > λ2d, where λ is a positive constant.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1988 Published by Elsevier Inc.