New Bounds for the Snake-in-the-Box Problem
classification
🧮 math.CO
cs.DM
keywords
boundsproblemdimensionalfindinghypercubeinducedlongestlower
read the original abstract
The Snake-in-the-Box problem is that of finding a longest induced path in an $n$-dimensional hypercube. We prove new lower bounds for the values $n\in \{11,12,13\}$. The Coil-in-the-Box problem is that of finding a longest induced cycle in an $n$-dimensional hypercube. We prove new lower bounds for the values $n\in \{12,13\}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.