Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

New bounds for the Snake-in-the-Box problem.

Allison, D. and Paulusma, D. (2019) 'New bounds for the Snake-in-the-Box problem.', Working Paper. Durham University.

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 ∈ {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 ∈ {10, 11, 12, 13}.

Item Type:Monograph (Working Paper)
Full text:(AO) Author's Original
Download PDF
(216Kb)
Status:Not peer-reviewed
Publisher Web site:UNSPECIFIED
Date accepted:No date available
Date deposited:No date available
Date of first online publication:24 September 2019
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar