# 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}

Author(s): Hirsch

- Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (222)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- Theoretical Comp. Sci. (13)
- Topology (40)
- Unsorted (1)

- Author index
- Keyword index