Fix $m,n \in \mathbb{N}$ with $m \ge n+1$. Take $m$ points in general position in $\mathbb{R}^n$ and let $P$ be their convex hull. What is the maximal number of (external, codimension-one) faces that $P$ can have, in terms of $m$ and $n$?

(Apologies if this is a well-known quantity.)

  • 4
    $\begingroup$ dual question: mathoverflow.net/questions/127423/… $\endgroup$
    – Jan Kyncl
    Jul 22, 2020 at 23:56
  • 2
    $\begingroup$ See the answers at Jan's link. "Cyclic polytopes maximize the number of facets for a fixed number of vertices." For you, $m$ is the number of vertices. $\endgroup$ Jul 23, 2020 at 0:32
  • 1
    $\begingroup$ Thank you both! This is extremely helpful, particularly the closed form. $\endgroup$
    – zjs
    Jul 23, 2020 at 5:11

1 Answer 1


The upper bound conjecture of Motzkin, made a theorem by McMullen in 1970, states that the highest number of facets among all polytopes with $m$ vertices in $\mathbb R^n$ is the number of facets of the cyclic polytope $\Delta(m,n)$.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.