Collapsibility of noncover complexes of chordal graphs
Jinha Kim

TL;DR
This paper proves that the noncover complex of a chordal graph is collapsible to a certain dimension, specifically related to the independence domination number, revealing topological properties of these complexes.
Contribution
It establishes a collapsibility result for noncover complexes of chordal graphs, linking graph invariants to topological properties.
Findings
Noncover complex of a chordal graph is collapsible.
Collapsibility dimension is related to the independence domination number.
Provides a topological characterization of noncover complexes.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Graph Theory Research · Advanced Combinatorial Mathematics
