A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates

DOI10.1007/BF01076356zbMath0548.52003OpenAlexW2041412625MaRDI QIDQ799242

K. A. Sevast'yanov, Sergei V. Konyagin

Publication date: 1984

Published in: Functional Analysis and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01076356

zbMATH Keywords

convex polyhedronnumber of vertices

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Polytopes and polyhedra (52Bxx)

Related Items (4)

Convex cones, integral zonotopes, limit shape ⋮ On the number of lattice free polytopes ⋮ Upper bounds on the maximal number of facets of 0/1-polytopes ⋮ On the classification of convex lattice polytopes

This page was built for publication: A bound, in terms of its volume, for the number of vertices of a convex polyhedron when the vertices have integer coordinates