  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 \leq k \leq d- 1$.
