On the snake in the box problem

https://doi.org/10.1016/0095-8956(88)90051-2Get rights and content
Under an Elsevier user license
open archive

Abstract

A 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.

Cited by (0)