Cores of simplicial complexes
组合数学
2007-05-23 v1 代数拓扑
摘要
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.
引用
@article{arxiv.math/0703351,
title = {Cores of simplicial complexes},
author = {Mario Marietti and Damiano Testa},
journal= {arXiv preprint arXiv:math/0703351},
year = {2007}
}
备注
26 pages, 2 figures. Comments are very welcome!