Article contents
Hamiltonian Circuits on the N-Cube
Published online by Cambridge University Press: 20 November 2018
Extract
The problem of finding bounds for the number h(n) of Hamiltonian circuits on the n-cube has been studied by several authors, (1), (2), (3). The best upper bound known is due to Larman (5) who proved that .
In this paper we use a result of Nijenhuis and Wilf (4) on permanents of (0, 1)- matrices to show that for n≥5
where τ, a and c are constants.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1975
References
- 2
- Cited by