Splittings of independence complexes and the powers of cycles
From MaRDI portal
(Redirected from Publication:412186)
Abstract: We use two cofibre sequences to identify some combinatorial situations when the independence complex of a graph splits into a wedge sum of smaller independence complexes. Our main application is to give a recursive relation for the homotopy types of the independence complexes of powers of cycles, which answers an open question of D. Kozlov.
Recommendations
Cites work
- scientific article; zbMATH DE number 6464016 (Why is no real title available?)
- Algebraic properties of edge ideals via combinatorial topology
- Combinatorial algebraic topology
- Complexes of directed trees
- Complexes of directed trees and independence complexes
- Cores of simplicial complexes
- Domination numbers and homology
- Graph theory
- Hard squares with negative activity on cylinders with odd circumference
- Independence complexes of chordal graphs
- Independence complexes of claw-free graphs
- Independent systems of representatives in weighted graphs
- On a lower bound for the connectivity of the independence complex of a graph
- Shellability of complexes of directed trees
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Star clusters in independence complexes of graphs
- Subdivision yields Alexander duality on independence complexes
- The topology of the independence complex
- Vertex decomposable graphs and obstructions to shellability
- polymake: a framework for analyzing convex polytopes
Cited in
(16)- Matching complexes of polygonal line tilings
- A note on independence complexes of chordal graphs and dismantling
- General polygonal line tilings and their matching complexes
- Matching complexes of small grids
- Matching and independence complexes related to small grids
- Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs
- Cohen-Macaulay circulant graphs
- Clique complexes and graph powers
- On the homology of independence complexes
- On the homotopy type of the polyhedral join over the independence complex of a forest
- Dominance complexes and vertex cover numbers of graphs
- Dominance complexes, neighborhood complexes and combinatorial Alexander duals
- Independence complexes of well-covered circulant graphs
- Perfect matching complexes of honeycomb graphs
- Matching complexes of trees and applications of the matching tree algorithm
- Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs
This page was built for publication: Splittings of independence complexes and the powers of cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412186)
