On a lower bound for the connectivity of the independence complex of a graph

DOI10.1016/j.disc.2011.06.010zbMath1238.05152OpenAlexW2046769324MaRDI QIDQ409373

Michał Adamaszek, Jonathan Ariel Barmak

Publication date: 13 April 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.010

zbMATH Keywords

independence complextopological connectivity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Combinatorial aspects of simplicial complexes (05E45)

Related Items

A second-order output spectrum approach for fault detection of bolt loosening in a satellite-like structure with a sensor chain, On a conjecture of Stein, Splittings of independence complexes and the powers of cycles, Degree Conditions for Matchability in 3‐Partite Hypergraphs, Coxeter cochain complexes, Two disjoint independent bases in matroid-graph pairs, A Stability Theorem for Matchings in Tripartite 3-Graphs, Hilbert function and facet ideals of products of simplicial complexes, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Cooperative colorings and independent systems of representatives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of group theoretic problems
• Independence complexes of chordal graphs
• Domination numbers and homology
• Independent systems of representatives in weighted graphs