Graphs, skeleta and reconstruction of polytopes
From MaRDI portal
(Redirected from Publication:722351)
Abstract: A renowned theorem of Blind and Mani, with a constructive proof by Kalai and an efficiency proof by Friedman, shows that the whole face lattice of a simple polytope can be determined from its graph. This is part of a broader story of reconstructing face lattices from partial information, first considered comprehensively in Gr"unbaum's 1967 book. This survey paper includes varied results and open questions by many researchers on simplicial polytopes, nearly simple polytopes, cubical polytopes, zonotopes, crosspolytopes, and Eulerian posets.
Recommendations
Cites work
- scientific article; zbMATH DE number 1953195 (Why is no real title available?)
- scientific article; zbMATH DE number 1538125 (Why is no real title available?)
- scientific article; zbMATH DE number 1538126 (Why is no real title available?)
- A necessary condition for d-polyhedrality
- A simple way to tell a simple polytope from its graph
- Bier spheres and posets
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Congruent Graphs and the Connectivity of Graphs
- Construction and analysis of projected deformed products
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Diagrams for centrally symmetric polytopes
- Examples and counterexamples for the Perles conjecture
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
- Finding a simple polytope from its graph in polynomial time
- How neighborly can a centrally symmetric polytope be?
- Hyperplane arrangements with a lattice of regions
- Incidence graphs and unneighborly polytopes
- Lectures on Polytopes
- Many neighborly polytopes and oriented matroids
- Neighborly cubical polytopes
- Neighborly cubical polytopes and spheres
- Neighborly cubical spheres and a cubical lower bound conjecture
- Non-projectability of polytope skeleta
- On the \(k\)-systems of a simple polytope
- Polytopality and Cartesian products of graphs
- Prodsimplicial-neighborly polytopes
- Puzzles and polytope isomorphisms
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- The excess degree of a polytope
- The graph of an abstract polytope
- Triangulated n-manifolds are determined by their \([n/2]+1\)-skeletons
Cited in
(13)- scientific article; zbMATH DE number 1066362 (Why is no real title available?)
- Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
- scientific article; zbMATH DE number 1538125 (Why is no real title available?)
- scientific article; zbMATH DE number 1538126 (Why is no real title available?)
- On potential theoretic skeletons of polyhedra
- The E_t-construction for lattices, spheres and polytopes
- The graphs behind reuleaux polyhedra
- Reconstructing simplicial polytopes from their graphs and affine 2-stresses
- Graphs of polyhedra; polyhedra as graphs
- Topology of complements of skeletons
- The complete enumeration of 4-polytopes and 3-spheres with nine vertices
- On the faces of simple polytopes
- Reconstructibility of matroid polytopes
This page was built for publication: Graphs, skeleta and reconstruction of polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722351)
