On connectivity of the facet graphs of simplicial complexes

Research output: Contribution to journalArticlepeer-review


The paper studies the connectivity properties of facet graphs of simplicial complexes of combinatorial interest. In particular, it is shown that the facet graphs of d-cycles, d-hypertrees and d-hypercuts are, respectively, (d +1)-, d-and (n − d − 1)-vertex-connected. It is also shown that the facet graph of a d-cycle cannot be split into more than s connected components by removing at most s vertices. In addition, the paper discusses various related issues, as well as an extension to cell-complexes.

Original languageEnglish
Pages (from-to)521-545
Number of pages25
JournalIsrael Journal of Mathematics
Issue number2
StatePublished - 1 Oct 2019

Bibliographical note

Publisher Copyright:
© 2019, The Hebrew University of Jerusalem.

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'On connectivity of the facet graphs of simplicial complexes'. Together they form a unique fingerprint.

Cite this