On the graph-connectivity of skeleta of convex polytopes

Details On the graph-connectivity of skeleta of convex polytopes On the graph-connectivity of skeleta of convex polytopes

2008-01-07

arxiv.org/abs/0801.0939v2

Mathematics

Combinatorics

Added Remark 1.2 and reference to the article [Incidence graphs of convex polytopes, J. Combin. Theory 2 (1967), 466-506] by G

Scientific paper

Given a $d$-dimensional convex polytope $P$ and nonnegative integer $k$ not exceeding $d-1$, let $G_k (P)$ denote the simple graph on the node set of $k$-dimensional faces of $P$ in which two such faces are adjacent if there exists a $(k+1)$-dimensional face of $P$ which contains them both. The graph $G_k (P)$ is isomorphic to the dual graph of the $(d-k)$-dimensional skeleton of the normal fan of $P$. For fixed values of $k$ and $d$, the largest integer $m$ such that $G_k (P)$ is $m$-vertex-connected for all $d$-dimensional polytopes $P$ is determined. This result generalizes Balinski's theorem on the one-dimensional skeleton of a $d$-dimensional convex polytope.

Affiliated with

Also associated with

No associations

Rating

On the graph-connectivity of skeleta of convex polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the graph-connectivity of skeleta of convex polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the graph-connectivity of skeleta of convex polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653909