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

From MaRDI portal
Publication:2229199




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.









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)