Bounds on the connectivity of the independence complexes of hypergraphs

2024/11/15 by Demet Taylan, Taylan, Demet · 1 citation
Computer Science · #05C65 #05C69 #55U10 #Algebraic Topology (math.AT) #Combinatorics (math.CO) #Data Visualization and Analytics #FOS: Mathematics #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2411.10365

openalex publication_date 2024/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of d-uniform properly-connected triangulated hypergraphs.

Cited by

• Closed neighborhood complexes of graphs

Related

• An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs
• Topology of independence complexes and cycle structure of hypergraphs
• Independence complexes of claw-free graphs
• New lower bounds for the independence number of sparse graphs and hypergraphs
• Distance r-domination number and r-independence complexes of graphs