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

DOI10.1016/J.DISC.2011.06.010MaRDI QIDQ409373zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Independence complexes of claw-free graphs
• Independence in connected graphs
• scientific article; zbMATH DE number 2211584
• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• Topological connectedness and independent sets in graphs

Cites work

• scientific article; zbMATH DE number 2103273 (Why is no real title available?)
• scientific article; zbMATH DE number 3417456 (Why is no real title available?)
• scientific article; zbMATH DE number 3110205 (Why is no real title available?)
• Domination numbers and homology
• Independence complexes of chordal graphs
• Independent systems of representatives in weighted graphs
• Recursive unsolvability of group theoretic problems

Cited in

(14)

• Two disjoint independent bases in matroid-graph pairs
• On a conjecture of Stein
• Cooperative colorings and independent systems of representatives
• Splittings of independence complexes and the powers of cycles
• A stability theorem for matchings in tripartite 3-graphs
• A second-order output spectrum approach for fault detection of bolt loosening in a satellite-like structure with a sensor chain
• Complexes of graphs with bounded independence number
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• Lower bounds on the vertex-connectivity of digraphs and graphs
• Degree conditions for matchability in 3-partite hypergraphs
• Independence complexes of claw-free graphs
• Hilbert function and facet ideals of products of simplicial complexes
• Coxeter cochain complexes
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

This page was built for publication: On a lower bound for the connectivity of the independence complex of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409373)