An inequality for 3-polytopes (Q1065016): Difference between revisions

We prove the inequality \(\sum_{n\geq 7}(n-6)p_ n\leq v-12\) for any 3- dimensional polytope (hence any 3-connected planar graph) with v vertices and \(p_ n\) n-sided faces, such that \(\sum_{n\geq 6}p_ n\geq 3\). We characterize the polytopes satisfying \(\sum_{n\geq 7}(n-6)p_ n=v-12\). As an application, we show that the density of n-sided faces \(a_ n=np_ n/v\) satisfies: \(a_ n<2n/(n-2)\) for \(3\leq n\leq 6\), \(a_ n<3n/(2n-6)\) for \(6\leq n\leq 12\) and \(a_ n<n/(n-6)\) for \(n\geq 12\). These bounds are best possible.