English

Octahedralizing 3-colorable 3-polytopes

Combinatorics 2019-12-19 v2

Abstract

We investigate the question of whether any dd-colorable simplicial dd-polytope can be octahedralized, i.e., it can be subdivided to a dd-dimensional geometric cross-polytopal complex. We give a positive answer in dimension 33, with the additional property that the octahedralization introduces no new vertices on the boundary of the polytope.

Keywords

Cite

@article{arxiv.1903.10178,
  title  = {Octahedralizing 3-colorable 3-polytopes},
  author = {Giulia Codenotti and Lorenzo Venturello},
  journal= {arXiv preprint arXiv:1903.10178},
  year   = {2019}
}

Comments

13 pages, 6 figures, revised version

R2 v1 2026-06-23T08:17:50.646Z