Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cores of Simplicial Complexes

Cores of Simplicial Complexes We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer some questions raised in (Ehrenborg and Hetyei in Eur. J. Comb. 27(6):906–923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy types. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete & Computational Geometry Springer Journals

Loading next page...
 
/lp/springer-journals/cores-of-simplicial-complexes-CnT8GPsNs6

References (31)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Mathematics; Computational Mathematics and Numerical Analysis; Combinatorics
ISSN
0179-5376
eISSN
1432-0444
DOI
10.1007/s00454-008-9081-y
Publisher site
See Article on Publisher Site

Abstract

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. Applying this method to complexes arising from graphs, we give topological meaning to classical graph invariants. As a consequence, we answer some questions raised in (Ehrenborg and Hetyei in Eur. J. Comb. 27(6):906–923, 2006) on the independence complex and the dominance complex of a forest and obtain improved algorithms to compute their homotopy types.

Journal

Discrete & Computational GeometrySpringer Journals

Published: May 15, 2008

There are no references for this article.