New Bounds for the SnakeintheBox Problem
Abstract
The SnakeintheBox 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 CoilintheBox 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\}$.
 Publication:

arXiv eprints
 Pub Date:
 March 2016
 arXiv:
 arXiv:1603.05119
 Bibcode:
 2016arXiv160305119A
 Keywords:

 Mathematics  Combinatorics;
 Computer Science  Discrete Mathematics
 EPrint:
 We improved six lower bounds from the previous version (two for snakeinthebox and four for coilinthebox)