Star clusters in independence complexes of graphs
From MaRDI portal
Abstract: We introduce the notion of extit{star cluster} of a simplex in a simplicial complex. This concept provides a general tool to study the topology of independence complexes of graphs. We use star clusters to answer a question arisen from works of Engstr"om and Jonsson on the homotopy type of independence complexes of triangle-free graphs and to investigate a large number of examples which appear in the literature. We present an alternative way to study the chromatic number of a graph from a homotopical point of view and obtain new results regarding the connectivity of independence complexes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1973373 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 3257107 (Why is no real title available?)
- A local criterion for Tverberg graphs
- Algebraic topology of finite topological spaces and applications
- Betti numbers of monomial ideals and shifted skew shapes
- Chessboard Complexes and Matching Complexes
- Complexes of directed trees
- Complexes of directed trees and independence complexes
- Graph homotopy and Graham homotopy
- Homology groups of relations
- Homology of certain sets of 2-subgroups of symmetric groups
- Independence complexes of claw-free graphs
- Independence complexes of stable Kneser graphs
- Independent systems of representatives in weighted graphs
- Kneser's conjecture, chromatic number, and homotopy
- Lusternik-Schnirelmann category and strong category
- On Quillen's theorem A for posets
- On Spaces Having the Homotopy Type of a CW-Complex
- On the independence complex of square grids
- Proof of the Lovász conjecture
- Simplicial simple-homotopy of flag complexes in terms of graphs
- Strong homotopy types, nerves and collapses
- Subdivision yields Alexander duality on independence complexes
- The topology of the independence complex
- Torsion in the matching complex and chessboard complex
Cited in
(31)- A hierarchy of dismantlings in graphs
- On Quillen's theorem A for posets
- Distance \(r\)-domination number and \(r\)-independence complexes of graphs
- Higher independence complexes of graphs and their homotopy types
- Dominance complexes, neighborhood complexes and combinatorial Alexander duals
- Vertex decomposability of complexes associated to forests
- Topological connectedness and independent sets in graphs
- Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs
- Clique complexes and graph powers
- scientific article; zbMATH DE number 7499158 (Why is no real title available?)
- Extremal problems related to Betti numbers of flag complexes
- Further applications of clutter domination parameters to projective dimension
- Topology of clique complexes of line graphs
- Splittings of independence complexes and the powers of cycles
- A dual independence complex
- On Vietoris-Rips complexes of hypercube graphs
- Complexity of simplicial homology and independence complexes of chordal graphs
- On endo-homology of complexes of graphs
- Matching complexes of trees and applications of the matching tree algorithm
- On the homology of independence complexes
- Domination numbers and noncover complexes of hypergraphs
- scientific article; zbMATH DE number 1559018 (Why is no real title available?)
- Matching and independence complexes related to small grids
- Dominance complexes and vertex cover numbers of graphs
- The cubical matching complex revisited
- Aspects of topological approaches for data science
- Independence complexes of claw-free graphs
- Random cyclic dynamical systems
- Star clusters in the matching, Morse, and generalized complex of discrete Morse functions
- On Vietoris-Rips complexes of finite metric spaces with scale 2
- Homotopy type of circle graph complexes motivated by extreme Khovanov homology
This page was built for publication: Star clusters in independence complexes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390992)
