Collapsibility of noncover complexes of chordal graphs
arXiv:1904.04519
Abstract
Let be a graph on . A vertex subset is called a cover of if its complement is an independent set, and is called a noncover if it is not a cover of . A noncover complex of is the simplicial complex on whose faces are noncovers of . The independence domination number of is the minimum integer such that every independent set of can be dominated by vertices. In this note, we prove that is -collapsible.