Binomial edge ideals of cographs
Revista de la Unión Matemática Argentina(2019)
Abstract
We determine the Castelnuovo--Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). On $n$ vertices the maximum regularity is essentially $2n/3$. Independently of the number of vertices, we also bound the regularity by graph theoretic invariants. Finally, we construct a family of counterexamples to a recent conjecture of Hibi and Matsuda.
MoreTranslated text
Key words
binomial edge ideals,cographs
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined