Arbitrarily large neighborly families of symmetric convex polytopes

Research output: Contribution to journalArticlepeer-review


A family of convex d-polytopes in Edis called neighborly if every two of them have a (d-1)-dimensional intersection. Settling an old problem of B. Grünbaum, we show that there exist arbitrarily large neighborly families of centrally (or any other prescribed type of) symmetric convex d-poliytopes in Ed,for all d≥3; moreover, they can all be congruent, if d≥4.

Original languageEnglish
Pages (from-to)175-179
Number of pages5
JournalGeometriae Dedicata
Issue number2
StatePublished - Apr 1986

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'Arbitrarily large neighborly families of symmetric convex polytopes'. Together they form a unique fingerprint.

Cite this