Construct · 1 fields · 1 citations

Hirsch conjecture: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
Hirschconjecture1 CONSTRUCTHirsch conjectureSANTOS · COMBINATORIAL

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorial optimization

the conjecture that any two vertices of a d-dimensional polytope with n facets are joined by an edge path of length at most n - d, later disproved.

In combinatorial optimization, Hirsch conjecture refers to the conjecture that any two vertices of a d-dimensional polytope with n facets are joined by an edge path of length at most n - d, later disproved. This meaning comes from Santos (2012) in Annals of Mathematics.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how Hirsch conjecture sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

edge5 fields · 5 citationsjingle · one word, five constructspath3 fields · 3 citationsjingle · one word, three constructs

References

  1. Santos, F. (2012). A counterexample to the Hirsch Conjecture. Annals of Mathematics, 176(1), 383-412. https://doi.org/10.4007/annals.2012.176.1.7

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct