Graphs, skeleta and reconstruction of polytopes
From MaRDI portal
Publication:722351
DOI10.1007/S10474-018-0804-0zbMATH Open1413.52020arXiv1710.00118OpenAlexW2963615202MaRDI QIDQ722351FDOQ722351
Authors: D. Kharzeev 
Publication date: 23 July 2018
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1710.00118
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) (n)-dimensional polytopes (52B11)
Cites Work
- Lectures on Polytopes
- Neighborly cubical polytopes
- Examples and counterexamples for the Perles conjecture
- Many neighborly polytopes and oriented matroids
- Congruent Graphs and the Connectivity of Graphs
- Diagrams for centrally symmetric polytopes
- Hyperplane arrangements with a lattice of regions
- Incidence graphs and unneighborly polytopes
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- A simple way to tell a simple polytope from its graph
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Triangulated n-manifolds are determined by their \([n/2]+1\)-skeletons
- Puzzles and polytope isomorphisms
- How neighborly can a centrally symmetric polytope be?
- Construction and analysis of projected deformed products
- On the \(k\)-systems of a simple polytope
- Bier spheres and posets
- Prodsimplicial-neighborly polytopes
- Neighborly cubical spheres and a cubical lower bound conjecture
- Non-projectability of polytope skeleta
- Neighborly cubical polytopes and spheres
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
- Title not available (Why is that?)
- Finding a simple polytope from its graph in polynomial time
- Polytopality and Cartesian products of graphs
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
- A necessary condition for d-polyhedrality
- The graph of an abstract polytope
- Title not available (Why is that?)
- Title not available (Why is that?)
- The excess degree of a polytope
Cited In (13)
- Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
