@article {IOPORT.06074018,
    author       = {Santos, Francisco},
    title        = {A counterexample to the Hirsch conjecture.},
    year         = {2012},
    journal      = {Annals of Mathematics. Second Series},
    volume       = {176},
    number       = {1},
    issn         = {0003-486X},
    pages        = {383-412},
    publisher    = {Princeton University, Mathematics Department, Princeton, NJ; Mathematical Sciences Publishers, Berkeley, CA},
    doi          = {10.4007/annals.2012.176.1.7},
    abstract     = {The Hirsch Conjecture from 1957 states that the graph of a $d$-dimensional polytope with $n$ facets cannot have combinatorial diameter greater than $n-d$. That is, any two vertices of the polytope can be connected by a path of at most $n-d$ edges. In this paper this general conjecture is disproved by presenting a counterexample to it. The polytope of the counterexample has dimension $43$ and $86$ facets.},
    reviewer     = {Arnfried Kemnitz (Braunschweig)},
    identifier   = {06074018},
}