Abstract
We show that for every d-dimensional polytope, the hypergraph whose nodes are k-faces and whose hyperedges are \((k+1)\)-faces of the polytope is strongly \((d-k)\)-vertex connected, for each \(0 \le k \le d- 1\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability Statement
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
References
Athanasiadis, Ch.A.: On the graph connectivity of skeleta of convex polytopes. Discrete Comput. Geom. 42(2), 155–165 (2009)
Balinski, M.L.: On the graph structure of convex polyhedra in \(n\)-space. Pacific J. Math. 11(2), 431–434 (1961)
Maclagan, D., Yu, J.: Higher connectivity of tropicalizations. Math. Ann. (2021). https://doi.org/10.1007/s00208-021-02281-9
Sallee, G.T.: Incidence graphs of convex polytopes. J. Comb. Theory 2(4), 466–506 (1967)
Acknowledgements
We thank Diane Maclagan for discussions and the referee for comments which helped improve the exposition.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Editor in Charge: János Pach
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
JY was partially supported by National Science Foundation, Division of Mathematical Sciences Grant #1855726.
Rights and permissions
About this article
Cite this article
Hathcock, D., Yu, J. On the Hypergraph Connectivity of Skeleta of Polytopes. Discrete Comput Geom 69, 593–596 (2023). https://doi.org/10.1007/s00454-021-00362-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-021-00362-9