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 be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that is the cover ideal and is its -th symbolic power. We prove thatWe also determine families of graphs for which the above inequalities are equality.
Paper Prompts
Sign up for free to create and run prompts on this paper.