2000 character limit reached
On the cover ideals of chordal graphs
Published 28 Jun 2019 in math.AC and math.CO | (1906.12144v1)
Abstract: The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive formulas for the Betti numbers of cover ideals of chordal graphs. Also, we give a new proof of their result which yields different shellings of the independence complex.
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.