Content of review 1, reviewed on October 18, 2015
The Bounded Hirsch Conjecture states that the diameter of the facet-ridge graph of any (d+1)-polytope on n vertices is ≤n-(d+1). This conjecture was proved to be false in the year 2012 by F. Santos [Ann. Math. (2) 176, No. 1, 383–412 (2012; Zbl 1252.52007)]. An equivalent conjecture, which states that any two facets of a simplicial polytope can be connected by a nonrevisiting path, was also introduced in 1960. In this article, the authors study some particular kinds of complexes wherein the Hirsch Conjecture is true, e.g., it has been proved geometrically and combinatorially that flag normal simplicial complexes satisfy the Hirsch Conjecture; flag polytopes, derived subdivision of any triangulation of a connected manifold also satisfy the Hirsch Conjecture.
Source
© 2015 the Reviewer (CC BY 4.0).
