Skeleton Chordalities
arXiv:2607.21166
Abstract
We study new higher-dimensional analogs of graph chordality and review the existing ones. Our main results for simplicial complexes are: (1) skeleton-E-chordal vertex-decomposable skeleton-clique-chordal. Moreover, for subflag complexes, skeleton-E-chordal vertex-decomposable. (For this boils down to `` chordal vertex-decomposable'', a result closely related to Fröberg's theorem.) (2) For subflag complexes, is skeleton-E-chordal it splits as , with each a skeleton-E-chordal induced subcomplex of , and with a complex whose -skeleton is a clique. (This generalizes `` chordal splits as a union of chordal graphs that intersect in a common clique''). (3) skeleton-E-chordal every nonempty induced subcomplex of has a skeleton-E-simplicial vertex. (Generalizes `` chordal every nonempty induced subgraph has a simplicial vertex''.) (4) underclosed skeleton-weakly-chordal and weakly-closed. (Generalizes `` interval chordal and co-comparability''.) (5) All pure E-chordal complexes are vertex-chordal; all pure mid-chordal complexes are weakly-vertex-chordal; all pure very-weakly-chordal complexes are weakly-ridge-chordal. (This expands Bigdeli, Yazdan-Pour and Zaare-Nahandi's work on ridge-chordality.)