Regularity of symbolic powers of cover ideals of graphs

被引：13
|
作者：
Fakhari, S. A. Seyed [1 ]
机构：
[1] Univ Tehran, Coll Sci, Sch Math Stat & Comp Sci, Tehran, Iran
来源：
COLLECTANEA MATHEMATICA | 2019年 / 70卷 / 02期
关键词：
Cover ideal; Regularity; Symbolic power; STANLEY DEPTH;
D O I：
10.1007/s13348-018-0228-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let G be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw-free graphs. Assume that J(G) is the cover ideal G and J(G)(k) is its k-th symbolic power. We prove that kdeg(J(G))reg(J(G)(k))(k-1)deg(J(G))+We also determine families of graphs for which the above inequalities are equality.
引用
收藏
页码：187 / 195
页数：9
相关论文
共 50 条
12345