2015/01/15 by Nikolai Erokhovets, Erokhovets, Nikolai
Computer Science · Engineering · Mathematics · #52B10 #90C57 #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Metric Geometry (math.MG) #Optimization and Packing Problems #graph theory and CDMA systems #math.CO #math.MG #msc:52B10 #msc:90C57
paper · pdf · doi:10.48550/arxiv.1501.03801
4 pages
arxiv created 2015/01/15 · openalex publication_date 2015/01/15 · arxiv updated 2015/01/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study the operation of cutting off edges of a simple 3-polytope P along the graph Γ. 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.