- Title
- Polytopes close to being simple
- Creator
- Pineda-Villavicencio, Guillermo; Ugon, Julien; Yost, David
- Date
- 2020
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/173340
- Identifier
- vital:14666
- Identifier
-
https://doi.org/10.1007/s00454-018-00053-y
- Identifier
- ISBN:0179-5376 (ISSN)
- Abstract
- It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that d-polytopes with at most d- 2 nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and d- 2 , showing that certain polytopes with more than two nonsimple vertices are reconstructible from their graphs. In particular, we prove that reconstructibility from graphs also holds for d-polytopes with d+ k vertices and at most d- k+ 3 nonsimple vertices, provided k
- Publisher
- Springer
- Relation
- Discrete and Computational Geometry Vol. 64, no. 1 (2020), p. 200-215; http://purl.org/au-research/grants/arc/DP180100602
- Rights
- Copyright © Springer Science+Business Media, LLC, part of Springer Nature 2018
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; 0103 Numerical and Computational Mathematics; 0802 Computation Theory and Mathematics; k-Skeleton; Reconstruction; Simple polytope
- Full Text
- Reviewed
- Hits: 1299
- Visitors: 1429
- Downloads: 170
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Published | 567 KB | Adobe Acrobat PDF | View Details Download |