Graph-truncations of $3$-polytopes

Nikolai Erokhovets

Graph-truncations of $3$-polytopes

Combinatorics 2015-01-16 v1 Metric Geometry

Authors: Nikolai Erokhovets

Abstract

In this paper we study the operation of cutting off edges of a simple $3$ -polytope $P$ along the graph $\Gamma$ . We give the criterion when the resulting polytope is simple and when it is flag. As a corollary we prove the analog of Eberhard's theorem about the realization of polygon vectors of simple $3$ -polytopes for flag polytopes.

Keywords

polytopes graph theory graph polynomials

Cite

@article{arxiv.1501.03801,
  title  = {Graph-truncations of $3$-polytopes},
  author = {Nikolai Erokhovets},
  journal= {arXiv preprint arXiv:1501.03801},
  year   = {2015}
}

Comments

4 pages

Related papers

View all related →