Binomial edge ideals of cographs
Commutative Algebra
2021-03-11 v2 Combinatorics
Abstract
We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with vertices the maximum regularity grows as . We also bound the regularity by graph theoretic invariants and construct a family of counterexamples to a conjecture of Hibi and Matsuda.
Cite
@article{arxiv.1906.05510,
title = {Binomial edge ideals of cographs},
author = {Thomas Kahle and Jonas Krüsemann},
journal= {arXiv preprint arXiv:1906.05510},
year = {2021}
}
Comments
11 pages, 2 figures. v2: Final version as in Revista de la Uni\'on Matem\'atica Argentina