arXiv Analytics

Sign in

arXiv:2012.14380 [math.CO]AbstractReferencesReviewsResources

A complete characterization of $(f_0, f_1)$-pairs of 6-polytopes

Karim Adiprasito, Rémi Cocou Avohou

Published 2020-12-28Version 1

We completely characterize the first two entries, namely the $(f_0, f_1)$-vector pairs, for $6$-dimension polytopes. We also find the characterization for $7$-dimension polytopes with excess degree greater than $11$ and, we conjecture bounds fulfilled by $(f_0, f_1)$-vector pairs for any $d$-polytope having an excess degree greater than $3d-10$.

Comments: 12 pages
Categories: math.CO
Subjects: 05C10, 57M15
Related articles: Most relevant | Search more
arXiv:2310.12283 [math.CO] (Published 2023-10-17)
A characterization of 4-connected graphs with no $K_{3,3}+v$-minor
arXiv:2110.14712 [math.CO] (Published 2021-10-27, updated 2022-01-20)
Complete characterization of the minimal-ABC trees
arXiv:2401.14653 [math.CO] (Published 2024-01-26)
Complete characterization of graphs with local total antimagic chromatic number 3