Collapsibility of noncover complexes of chordal graphs

Abstract

Let G be a graph on V. A vertex subset S ⊂ V is called a cover of G if its complement is an independent set, and S is called a noncover if it is not a cover of G. A noncover complex NC(G) of G is the simplicial complex on V whose faces are noncovers of G. The independence domination number iγ(G) of G is the minimum integer k such that every independent set of G can be dominated by k vertices. In this note, we prove that NC(G) is (|V|- iγ(G)-1)-collapsible.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…