Regularity of symbolic powers of cover ideals of graphs

Abstract

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 thatk deg(J(G))≤ reg(J(G)(k))≤ (k-1) deg(J(G))+|V(G)|-1.We also determine families of graphs for which the above inequalities are equality.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…