Hirsch conjecture
Description: The Hirsch conjecture is a statement in polyhedral combinatorics bounding shortest paths between vertices of a convex polytope.
Primary topic: Complexity and Algorithms in Graphs (60%)
Wikidata ID: wiki/Q2993326
OpenAlex ID: keywords/hirsch-conjecture
