The regularity of binomial edge ideals of graphs

نویسندگان
Saeedi Madani, Sara ID 1
Kiani, Dariush ID 2

1 Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic),Tehran, Iran

2 Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic),Tehran, Iran

doi
10.22060/ajmc.2020.16433.1024
چکیده

In this paper, we study the Castelnuovo-Mumford regularity and the graded Betti numbers of the binomial edge ideals of some classes of graphs. Our special attention is devoted to a conjecture which asserts that the number of maximal cliques of a graph provides an upper bound for the regularity of its binomial edge ideal.

کلیدواژه‌ها
Binomial edge ideal, Castelnuovo-Mumford regularity, free cut edge