Hirsch, Warren M.


Hirsch Conjecture ★★★

Author(s): Hirsch

\begin{conjecture} Let $P$ be a convex $d$-\Def{polytope} with $n$ \Def[facets]{Facet_(mathematics)}. Then the diameter of the graph of the polytope $P$ is at most $n-d$. \end{conjecture}

Keywords: diameter; polytope

Syndicate content