Splittings of independence complexes and the powers of cycles
From MaRDI portal
Publication:412186
DOI10.1016/J.JCTA.2012.01.009zbMATH Open1239.05196arXiv1106.6250OpenAlexW2041792460MaRDI QIDQ412186FDOQ412186
Authors: Michał Adamaszek 
Publication date: 4 May 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1106.6250
Recommendations
Cites Work
- polymake: a framework for analyzing convex polytopes
- Graph theory
- Combinatorial algebraic topology
- Shellable graphs and sequentially Cohen-Macaulay bipartite graphs
- Complexes of directed trees and independence complexes
- Complexes of directed trees
- Shellability of complexes of directed trees
- Algebraic properties of edge ideals via combinatorial topology
- Vertex decomposable graphs and obstructions to shellability
- Star clusters in independence complexes of graphs
- The topology of the independence complex
- Hard squares with negative activity on cylinders with odd circumference
- Subdivision yields Alexander duality on independence complexes
- Independent systems of representatives in weighted graphs
- Independence complexes of claw-free graphs
- Domination numbers and homology
- On a lower bound for the connectivity of the independence complex of a graph
- Title not available (Why is that?)
- Cores of simplicial complexes
- Independence complexes of chordal graphs
Cited In (14)
- Matching complexes of polygonal line tilings
- Cohen–Macaulay Circulant Graphs
- A note on independence complexes of chordal graphs and dismantling
- General polygonal line tilings and their matching complexes
- Matching complexes of small grids
- Independence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphs
- Matching and independence complexes related to small grids
- On the homology of independence complexes
- Independence Complexes of Well-Covered Circulant Graphs
- Dominance complexes and vertex cover numbers of graphs
- Dominance complexes, neighborhood complexes and combinatorial Alexander duals
- 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
Uses Software
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)
