On the snake in the box problem (Q1113920)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the snake in the box problem |
scientific article; zbMATH DE number 4081594
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the snake in the box problem |
scientific article; zbMATH DE number 4081594 |
Statements
On the snake in the box problem (English)
0 references
1988
0 references
\textit{A. A. Evdokimov} [Maximal length of a circuit in a unitary n- dimensional cube, Mat. Zametki 6, 309-319 (1969; Zbl 0216.558)] has proved that the length of a longest cycle without chords in the graph of d-cube is greater than \(c2^ d\), where c is a positive constant. A recurrence inequality is derived which yields a short and simple proof of this result.
0 references
longest cycle
0 references
graph
0 references
cube
0 references
0.9079081
0 references
0.8685219
0 references
0.84098625
0 references
0.8390703
0 references
0 references
0 references
