Polyhedral graph abstractions and an approach to the linear Hirsch conjecture (Q2436640)

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.