Regularity of binomial edge ideals

Abstract: This talk is going to be about the regularity of binomial edge ideals. We will discuss a combinatorial proof of regularity upper bound for binomial edge ideals given by Matsuda and Murai. There are two regularity upper bound conjectures for binomial edge ideals. We will be discussing these two conjectures. Saeedi Madani and Kiani conjectured that the regularity of the binomial edge ideal of a graph is bounded above by the number of cliques of that graph. Hibi and Matsuda conjectured that the regularity of the binomial edge ideal of a graph is bounded above by the degree of h polynomial of that graph.

commutative algebraalgebraic topologycombinatorics

Audience: researchers in the topic

Applications of Combinatorics in Algebra, Topology and Graph Theory

Series comments: To get email notification of the upcoming talk in this series, please subscribe to the mailing list or contact one of the organizers. Please visit webinar webpage for information about forthcoming and previous webinars. Thank you!