Star clusters in independence complexes of graphs

From MaRDI portal
Publication:390992

DOI10.1016/j.aim.2013.03.016zbMath1288.57004arXiv1007.0418OpenAlexW2963920974MaRDI QIDQ390992

Jonathan Ariel Barmak

Publication date: 9 January 2014

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0418




Related Items

Distance \(r\)-domination number and \(r\)-independence complexes of graphsTopology of clique complexes of line graphsOn the homology of independence complexesAspects of topological approaches for data scienceOn Vietoris-Rips complexes of hypercube graphsRandom cyclic dynamical systemsThe cubical matching complex revisitedHigher Independence Complexes of graphs and their homotopy typesClique complexes and graph powersMatching and independence complexes related to small gridsA hierarchy of dismantlings in graphsIndependence complexes of \((n \times 4)\) and \((n \times 5)\)-grid graphsExtremal problems related to Betti numbers of flag complexesSplittings of independence complexes and the powers of cyclesStar clusters in the matching, Morse, and generalized complex of discrete Morse functionsOn Vietoris-Rips complexes of finite metric spaces with scale 2Dominance complexes and vertex cover numbers of graphsOn Quillen's theorem A for posetsUnnamed ItemDomination numbers and noncover complexes of hypergraphsComplexity of simplicial homology and independence complexes of chordal graphsVertex decomposability of complexes associated to forestsHomotopy type of circle graph complexes motivated by extreme Khovanov homologyMatching complexes of trees and applications of the matching tree algorithmFurther applications of clutter domination parameters to projective dimension



Cites Work