Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00159856n
Noun Named Entity
Categories: Linear programming, Conjectures, Disproved conjectures, Polyhedral combinatorics
EN
Hirsch conjecture  d-step conjecture  Hirsch's conjecture
EN
In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d. Wikipedia
Definitions
Relations
Sources
EN
In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d. Wikipedia
IS A
statement
Wikipedia
EN
Hirsch conjecture
Wikidata
EN
Hirsch conjecture
Wikipedia Redirections
EN
d-step conjecture, Hirsch's conjecture, Hirsch Conjecture

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License