The Hirsch conjecture is true for (0,1)-polytopes (Q1825756)

The Hirsch conjecture tries to link the diameter \(\delta\), the number of facets f and the dimension d of a polytope by the following inequality: \(\delta\leq f-d\). This conjecture has been proved for some particular cases but remains unsolved for general polytopes. An extensive survey has been published by \textit{V. Klee} and \textit{P. Kleinschmidt} in Math. Oper. Res. 12, 718-755 (1987; Zbl 0632.52007)]. In this paper we prove that the conjecture is true for all polytopes which are convex hulls of vectors having only components with values in \(\{\) 0,1\(\}\). It was already known that the graphs associated with these polytopes are either hypercubes or Hamilton connected.