One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Access
PDF Availablehttps://doi.org/10.1137/21m144832x
Copy DOI
Export
Save
Share
Cite Journal: SIAM Journal on Discrete Mathematics |  Publication Date: Nov 21, 2022 |
 Citations: 1 |  License type: other-oa |
We establish the exact lower bound for the number of $k$-faces of $d$-polytopes with $2d+1$ vertices, for each value of $k$, and characterise the minimisers. As a byproduct, we characterise all $d$-polytopes with $d+3$ vertices, and only one or two edges more than the minimum.
Free) Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
