arXiv:math/0703351 Abstract

arXiv:math/0703351 [math.CO]Abstract References Reviews Resources

Cores of simplicial complexes

Published 2007-03-12Version 1

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in [R.Ehrenborg, G.Hetyei, European J.Combin.27 (2006), no.6, 906-923] on the independence complex and the dominance complex. The techniques used come mainly from monomial ideal theory.

Comments: 26 pages, 2 figures. Comments are very welcome!

Categories: math.CO, math.AT

Subjects: 57Q10, 05C69, 05C70

Keywords: simplicial complexes, monomial ideal theory, independence complex, dominance complex, consequence

Related articles: Most relevant | Search more

arXiv:1905.06926 [math.CO] (Published 2019-05-16)

Homotopy Type of Independence Complexes of Certain Families of Graphs

Shuchita Goyal, Samir Shukla, Anurag Singh

arXiv:2001.06775 [math.CO] (Published 2020-01-19)

Distance $r$-domination number and $r$-independence complexes of graphs

Priyavrat Deshpande, Samir Shukla, Anurag Singh

arXiv:2303.08798 [math.CO] (Published 2023-03-15)