New Bounds for the Snake-in-the-Box Problem
Combinatorics
2016-06-17 v2 Discrete Mathematics
Abstract
The Snake-in-the-Box problem is that of finding a longest induced path in an -dimensional hypercube. We prove new lower bounds for the values . The Coil-in-the-Box problem is that of finding a longest induced cycle in an -dimensional hypercube. We prove new lower bounds for the values .
Cite
@article{arxiv.1603.05119,
title = {New Bounds for the Snake-in-the-Box Problem},
author = {David Allison and Daniel Paulusma},
journal= {arXiv preprint arXiv:1603.05119},
year = {2016}
}
Comments
We improved six lower bounds from the previous version (two for snake-in-the-box and four for coil-in-the-box)