A proof for a conjecture on the regularity of binomial edge ideals

From MaRDI portal
Publication:2229199

DOI10.1016/J.JCTA.2021.105432zbMATH Open1459.13019arXiv2007.09959OpenAlexW3127619774WikidataQ113871627 ScholiaQ113871627MaRDI QIDQ2229199FDOQ2229199


Authors: Mohammad Rouzbahani Malayeri, Sara Saeedi Madani, Dariush Kiani Edit this on Wikidata


Publication date: 22 February 2021

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph G, we define the invariant eta(G) as the maximum size of a clique disjoint edge set in G. We show that the regularity of the binomial edge ideal of G is bounded above by eta(G). This, in particular, settles a conjecture on the regularity of binomial edge ideals in full generality.


Full work available at URL: https://arxiv.org/abs/2007.09959




Recommendations




Cites Work


Cited In (16)





This page was built for publication: A proof for a conjecture on the regularity of binomial edge ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229199)