A Proof of Gr\"unbaum's Lower Bound Conjecture for general polytopes
Combinatorics
2020-04-21 v1
Abstract
In 1967, Gr\"unbaum conjectured that any -dimensional polytope with vertices has at least -faces. We prove this conjecture and also characterize the cases in which equality holds.
Cite
@article{arxiv.2004.08429,
title = {A Proof of Gr\"unbaum's Lower Bound Conjecture for general polytopes},
author = {Lei Xue},
journal= {arXiv preprint arXiv:2004.08429},
year = {2020}
}