English

Collapsibility of noncover complexes of chordal graphs

Combinatorics 2019-04-10 v1

Abstract

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

Keywords

Cite

@article{arxiv.1904.04519,
  title  = {Collapsibility of noncover complexes of chordal graphs},
  author = {Jinha Kim},
  journal= {arXiv preprint arXiv:1904.04519},
  year   = {2019}
}