The upper bound theorem for polytopes: An easy proof of its asymptotic version
type: Item
instance of: scholarly article
title: The upper bound theorem for polytopes: An easy proof of its asymptotic version
zbMATH Open document ID: 0831.68114
DOI: 10.1016/0925-7721(95)00013-Y
author: Raimund Seidel
published in: Computational Geometry
publication date: 1995-10-29T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 810215
zbMATH Keywords: \(d\)-polytope
Wikidata QID: Q56047087
MaRDI profile type: Publication
cites work: Q5547252
cites work: On the Number of Vertices of a Convex Polytope
cites work: The maximum numbers of faces of a convex polytope
cites work: Lectures on Polytopes
full work available at URL: 0925-7721(95)00013-y
OpenAlex ID: W2088501747
DBLP publication ID: journals/comgeo/Seidel95
Recommended article: An Upper Bound Theorem for Polytope Pairs
Recommended article: An upper bound theorem for rational polytopes
Recommended article: An upper bound theorem concerning lattice polytopes
Recommended article: Q5111020
Recommended article: Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
Recommended article: An asymptotically improved upper bound on the diameter of polyhedra
Recommended article: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
Recommended article: A proof of Grünbaum's lower bound conjecture for general polytopes
Recommended article: Lower bound theorems for general polytopes
Recommended article: A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
description: scientific article; zbMATH DE number 810215