Chordality and Shellability of Higher Independence Complexes (2505.06614v1)

Abstract: This paper investigates the $r$-independence complex $\mathcal{I}_r(G)$ and its associated hypergraph $\mathcal{C}_r(G)$ from combinatorial and algebraic perspectives. We demonstrate that contrary to previous claims, $\mathcal{C}_r(G)$ need not be chordal even when $G$ is a tree, providing explicit counterexamples. Our results establish precise conditions for chordality across several graph classes: for cycles $C_n$, $\mathcal{C}_r(G)$ is chordal exactly when $n-2 \leq r \leq n-1$; for forests, chordality holds when $r \geq n-5$; and for block graphs, $\mathcal{C}_2(G)$ is always chordal. Furthermore, we show that $\mathcal{C}_r(G)$ remains chordal for all $r \geq 2$ in graphs with diameter constraints. The shellability of $\mathcal{I}_r(G)$ is proved through three fundamental constructions: star-clique attachments to vertex covers, generalized whiskering operations that preserve shellability under size constraints, and cyclic clique arrangements where shellability depends critically on attachment sizes. These results collectively generalize existing work on shellable independence complexes to the broader setting of higher independence complexes, revealing new connections between graph structure, hypergraph chordality, and algebraic properties of associated ideals.