Independence complexes of hypergraphs and bounded degree complexes

Abstract

The bounded degree complex $BD(G,\lambda )$ is a generalization of the matching complexes of a graph. In this paper, we show that the bounded degree complex of a forest is shellable, by using independence complexes of hypergraphs. We obtain a wedge decomposition result of bounded degree complexes when a graph $G$ has a leaf

The proof of this paper had a flaw. In fact, every chordal clutter is chordal but it is not true that the independence complex of a chordal "hypergraph" is not shellable in general. Correcting the proof may not be difficult, but a stronger result is already known; see "Vertex decomposability of complexes associated to forests" by Anurag Singh. So I withdraw this paper

References in corpus (1)

• Bounded degree complexes of forests

Cited by in corpus (1)

• Vertex decomposability of complexes associated to forests