A counterexample to the Hirsch Conjecture
Annals of mathematics, Tome 176 (2012) no. 1, pp. 383-412
The Hirsch Conjecture (1957) stated 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.
This paper presents the first counterexample to the conjecture. Our polytope has dimension $43$ and $86$ facets. It is obtained from a $5$-dimensional polytope with $48$ facets that violates a certain generalization of the $d$-step conjecture of Klee and Walkup.
@article{10_4007_annals_2012_176_1_7,
author = {Francisco Santos},
title = {A counterexample to the {Hirsch} {Conjecture}},
journal = {Annals of mathematics},
pages = {383--412},
year = {2012},
volume = {176},
number = {1},
doi = {10.4007/annals.2012.176.1.7},
mrnumber = {2925387},
zbl = {1252.52007},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4007/annals.2012.176.1.7/}
}
Francisco Santos. A counterexample to the Hirsch Conjecture. Annals of mathematics, Tome 176 (2012) no. 1, pp. 383-412. doi: 10.4007/annals.2012.176.1.7
Cité par Sources :