arXiv Analytics

Sign in

arXiv:1501.06754 [math.CO]AbstractReferencesReviewsResources

Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs

Demet Taylan

Published 2015-01-27Version 1

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their efficiency on some simplicial complexes, the devoid complexes of graphs, which are simplicial complexes parametrized by graphs. Additionally, we compute the homotopy type of dominance complexes of chordal graphs.

Comments: 19 pages
Categories: math.CO, math.AT
Subjects: 05C69, 05C70, 55U10
Related articles: Most relevant | Search more
arXiv:2412.19039 [math.CO] (Published 2024-12-26)
Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free
arXiv:0709.1291 [math.CO] (Published 2007-09-10, updated 2007-09-18)
On D.K. Biss' papers "The homotopy type of the matroid Grassmannian" and "Oriented matroids, complex manifolds, and a combinatorial model for BU"
arXiv:1905.06926 [math.CO] (Published 2019-05-16)
Homotopy Type of Independence Complexes of Certain Families of Graphs

Links

Toolbox