2020/10/10 by Daniel Hathcock, Hathcock, Daniel, Josephine Yu +1
Computer Science · Mathematics · #52B05 (Primary) 05C40 (Secondary) #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #math.CO #msc:05C40 #msc:52B05
paper · pdf · doi:10.48550/arxiv.2010.05053
3 pages, LaTeX; typos corrected, exposition clarified
openalex publication_date 2020/10/10 · arxiv created 2021/07/19 · arxiv updated 2021/07/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 ≤ k ≤ d- 1.