REGULARITY BOUNDS FOR BINOMIAL EDGE IDEALS

被引:61
|
作者
Matsuda, Kazunori [1 ]
Murai, Satoshi [2 ]
机构
[1] Rikkyo Univ, Coll Sci, Dept Math, Toshima Ku, Tokyo 1718501, Japan
[2] Yamaguchi Univ, Dept Math Sci, Fac Sci, Yamaguchi 7538512, Japan
关键词
D O I
10.1216/JCA-2013-5-1-141
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.
引用
收藏
页码:141 / 149
页数:9
相关论文
共 50 条