Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regularity of symbolic powers of cover ideals of graphs

Published 10 Sep 2017 in math.AC and math.CO | (1709.03077v1)

Abstract: Let GG 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)J(G) is the cover ideal GG and J(G)<sup>(k)J(G)<sup>{(k)} is its kk-th symbolic power. We prove thatkdeg(J(G))≤reg(J(G)<sup>(k))≤</sup>(k−1)deg(J(G))+∣V(G)∣−1.k{\rm deg}(J(G))\leq {\rm reg}(J(G)<sup>{(k)})\leq</sup> (k-1){\rm deg}(J(G))+|V(G)|-1.We also determine families of graphs for which the above inequalities are equality.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.