Independence complexes of hypergraphs and bounded degree complexes
Abstract
The bounded degree complex BD(G,λ) 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
