- Title
- A new proof of Balinski's theorem on the connectivity of polytopes
- Creator
- Pineda-Villavicencio, Guillermo
- Date
- 2021
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/176570
- Identifier
- vital:15160
- Identifier
-
https://doi.org/10.1016/j.disc.2021.112408
- Identifier
- ISBN:0012-365X (ISSN)
- Abstract
- Balinski (1961) proved that the graph of a d-dimensional convex polytope is d-connected. We provide a new proof of this result. Our proof provides details on the nature of a separating set with exactly d vertices; some of which appear to be new. © 2021 Elsevier B.V.
- Publisher
- Elsevier B.V.
- Relation
- Discrete Mathematics Vol. 344, no. 7 (2021), p.
- Rights
- All metadata describing materials held in, or linked to, the repository is freely available under a CC0 licence
- Rights
- Copyright @ 2021 Elsevier B.V. All rights reserved.
- Rights
- Open Access
- Subject
- 0101 Pure Mathematics; 0102 Applied Mathematics; 0802 Computation Theory and Mathematics; Balinski's theorem; Boundary complex; Connectivity; Link; Polytope; Separator
- Full Text
- Reviewed
- Hits: 5728
- Visitors: 5843
- Downloads: 204
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Accepted version | 330 KB | Adobe Acrobat PDF | View Details Download |