Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices
<|reference_start|>Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices: In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.<|reference_end|>
@article{elbassioni2005upper,
    title={Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint
  Matrices},
    author={Khaled Elbassioni, Zvi Lotker, Raimund Seidel},
    journal={arXiv preprint arXiv:cs/0507038},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0507038},
    primaryClass={cs.CG}
}