Graphs, skeleta and reconstruction of polytopes
From MaRDI portal
Publication:722351
DOI10.1007/s10474-018-0804-0zbMath1413.52020arXiv1710.00118OpenAlexW2963615202MaRDI QIDQ722351
Publication date: 23 July 2018
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00118
(n)-dimensional polytopes (52B11) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (4)
Reconstructibility of Matroid Polytopes ⋮ Topology of complements of skeletons ⋮ The complete enumeration of 4-polytopes and 3-spheres with nine vertices ⋮ Reconstructing \(d\)-manifold subcomplexes of cubes from their \((\lfloor d/2\rfloor+1)\)-skeletons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Many neighborly polytopes and oriented matroids
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- Prodsimplicial-neighborly polytopes
- Non-projectability of polytope skeleta
- Triangulated n-manifolds are determined by their \([n/2+1\)-skeletons]
- Construction and analysis of projected deformed products
- Hyperplane arrangements with a lattice of regions
- Neighborly cubical polytopes and spheres
- Finding a simple polytope from its graph in polynomial time
- Puzzles and polytope isomorphisms
- A simple way to tell a simple polytope from its graph
- Neighborly cubical spheres and a cubical lower bound conjecture
- Neighborly cubical polytopes
- On the \(k\)-systems of a simple polytope
- Examples and counterexamples for the Perles conjecture
- Polytopality and Cartesian products of graphs
- Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets
- Bier spheres and posets
- How neighborly can a centrally symmetric polytope be?
- A necessary condition for d-polyhedrality
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- The graph of an abstract polytope
- Lectures on Polytopes
- Congruent Graphs and the Connectivity of Graphs
- The Excess Degree of a Polytope
- Diagrams for centrally symmetric polytopes
- Cocircuit graphs and efficient orientation reconstruction in oriented matroids
This page was built for publication: Graphs, skeleta and reconstruction of polytopes
