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.
Recommendations
- scientific article; zbMATH DE number 866021
- On a class of Hamiltonian polytopes
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
- scientific article; zbMATH DE number 739027
- Hamiltonicity in (0-1)-polyhedra
- scientific article; zbMATH DE number 3849282
- On hamiltonian triangulations in simple polygons (Extended Abstract)
- Polyhedra of small order and their Hamiltonian properties
- Hamiltonian systems on polyhedra
- Hamiltonian submanifolds of regular polytopes
Cites work
Cited in
(9)- A property of graphs of convex polytopes
- Polyhedra with few 3-cuts are Hamiltonian
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
- Lower bound theorems for general polytopes
- scientific article; zbMATH DE number 3843793 (Why is no real title available?)
- scientific article; zbMATH DE number 3849282 (Why is no real title available?)
- On hamiltonian triangulations in simple polygons (Extended Abstract)
- Hamiltonian tournaments and Gorenstein rings
- Are all simple 4-polytopes Hamiltonian?
This page was built for publication: Hamiltonian simple polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900969)
