Hamiltonian simple polytopes (Q1900969)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hamiltonian simple polytopes |
scientific article |
Statements
Hamiltonian simple polytopes (English)
0 references
29 October 1995
0 references
The author shows that for every \(n \geq n_0(d)\) there is a simple \(d\)-polytope with \(n\) vertices whose graph contains a Hamiltonian circuit (where \(n_0 (d) \leq cd 2^d)\). This improves an earlier result of Klee, who constructed simple \(d\)-polytopes in which the longest cycle missed at most \(d - 2\) vertices.
0 references
simple polytopes
0 references
Hamiltonian circuit
0 references
longest cycle
0 references
