2000 character limit reached
Geometrically vertex decomposable open neighborhood ideals
Published 14 Dec 2025 in math.AC | (2512.12886v1)
Abstract: In this paper, we prove that the open neighborhood ideal of a TD-unmixed tree is geometrically vertex decomposable. This result implies that the associated Stanley-Reisner complex is vertex decomposable. We further demonstrate that Cohen-Macaulay open neighborhood ideals of trees are special cases of Cohen-Macaulay facet ideals of simplicial trees. Finally, we investigate open neighborhood ideals of chordal graphs and establish that almost all square-free monomial ideal can be realized as the open neighborhood ideal of a chordal graph.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.