Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (Q2436640)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6261671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyhedral graph abstractions and an approach to the linear Hirsch conjecture |
scientific article; zbMATH DE number 6261671 |
Statements
Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (English)
0 references
25 February 2014
0 references
This paper introduces a combinatorial abstraction for the graphs of polyhedra. The author formally explain some previous abstractions and survey the upper and lower bound. This paper discuss combinatorial properties defining special cases and then a new combinatorial abstraction namely \textit{subset partition graphs}. The upper and lower bounds as the diameters of the subset partition graphs satisfying a particular set of properties is discussed. Finally, a strategy is presented for disproving Linear Hirsch Conjecture.
0 references
convex polytopes
0 references
Hirsch conjecture
0 references
subset partition graph
0 references
0.9946610927581788
0 references
0.8227403163909912
0 references
0.8134629726409912
0 references
0.8042156100273132
0 references
0.8037175536155701
0 references
