On the number of facets of a 2-neighborly polytope
A d-polytope P is 2-neighborly if each 2 vertices of P determine an edge. It is conjectured that the number f0(P) of vertices for such polytope does not exceed the number fd-1(P) of facets. The conjecture is separately proved for d < 7 and for f0(P) < d+6.
| Format: | Article |
|---|---|
| Language: | English |
| Published: |
Yaroslavl State University
2010-03-01
|
| Series: | Modelirovanie i Analiz Informacionnyh Sistem |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/1022 |
| id |
doaj-45962ca9bbcd42eca5f859dcbfe7980f |
|---|---|
| record_format |
Article |
| spelling |
doaj-45962ca9bbcd42eca5f859dcbfe7980f2021-07-29T08:15:17ZengYaroslavl State UniversityModelirovanie i Analiz Informacionnyh Sistem1818-10152313-54172010-03-011717682763On the number of facets of a 2-neighborly polytope0Ярославский государственный университет им. П.Г. ДемидоваA d-polytope P is 2-neighborly if each 2 vertices of P determine an edge. It is conjectured that the number f0(P) of vertices for such polytope does not exceed the number fd-1(P) of facets. The conjecture is separately proved for d < 7 and for f0(P) < d+6.https://www.mais-journal.ru/jour/article/view/10222-neighborly polytopesnumber of facets |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| title |
On the number of facets of a 2-neighborly polytope |
| spellingShingle |
On the number of facets of a 2-neighborly polytope Modelirovanie i Analiz Informacionnyh Sistem 2-neighborly polytopes number of facets |
| title_short |
On the number of facets of a 2-neighborly polytope |
| title_full |
On the number of facets of a 2-neighborly polytope |
| title_fullStr |
On the number of facets of a 2-neighborly polytope |
| title_full_unstemmed |
On the number of facets of a 2-neighborly polytope |
| title_sort |
on the number of facets of a 2-neighborly polytope |
| publisher |
Yaroslavl State University |
| series |
Modelirovanie i Analiz Informacionnyh Sistem |
| issn |
1818-1015 2313-5417 |
| publishDate |
2010-03-01 |
| description |
A d-polytope P is 2-neighborly if each 2 vertices of P determine an edge. It is conjectured that the number f0(P) of vertices for such polytope does not exceed the number fd-1(P) of facets. The conjecture is separately proved for d < 7 and for f0(P) <
d+6. |
| topic |
2-neighborly polytopes number of facets |
| url |
https://www.mais-journal.ru/jour/article/view/1022 |
| _version_ |
1721256560084123648 |