Abstract
We describe the combinatorics of three families of simple - dimensional polytopes which play an important role in various problems of algebraic topology, hyperbolic geometry, graph theory, and their applications. The first family consists of simple polytopes with at most hexagonal faces. The second family consists of Pogorelov polytopes. The third family consists of fullerenes and is the intersection of the first two. We show that in the case of fullerenes there are stronger results than for the first two. Our main tools are -belts of faces, simple partitions of a disc and the operations of transformation and connected sum.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
