Hamiltonian simple polytopes
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.
scientific article; zbMATH DE number 810124
scientific article