The complex of $r$-co-connected subgraphs, chordality and Fr\"oberg's theorem
Priyavrat Deshpande, Amit Roy, Rutuja Sawant

TL;DR
This paper introduces the $r$-co-connected complex of a graph, exploring its topological, combinatorial, and algebraic properties, extending Fr"oberg's theorem to $r$-connected ideals for various graph classes.
Contribution
It defines the $r$-co-connected complex, proves vertex decomposability under certain conditions, and extends Fr"oberg's theorem to $r$-connected ideals in multiple graph classes.
Findings
Vertex decomposability when $G[A]$ is connected and nonempty
Equivalence of properties for certain graph classes when $A= ext{empty}$ and $r extgreater=2$
Extension of Fr"oberg's theorem to $r$-connected ideals
Abstract
We introduce a new family of pure simplicial complexes, called the -co-connected complex of with respect to , , where is a natural number, is a simple graph, and is a subset of vertices. Interestingly, when is empty, this complex is precisely the Alexander dual of the -independence complex of . We focus on uncovering the relationship between the topological and combinatorial properties of the complex and the algebraic and homological properties of the Stanley-Reisner ideal of the dual complex. First, we prove that is vertex decomposable whenever the induced subgraph is connected and nonempty, yielding a versatile deletion-link calculus for higher independence via Alexander duality. Furthermore, when and , we establish that for several significant classes of graphs - including chordal,…
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.
