Regularity of Powers of Bipartite Graphs

preprint2016arXivOpen access

Abstract

Let GG be a finite simple graph and I(G)I(G) denote the corresponding edge ideal. For all s≥1s \geq 1, we obtain upper bounds for reg(I(G)s)(I(G)^s) for bipartite graphs. We then compare the properties of GG and G′G', where G′G' is the graph associated with the polarization of the ideal (I(G)s+1:e1⋯es)(I(G)^{s+1} : e_1\cdots e_s), where e1,…ese_1,\ldots e_s are edges of GG. Using these results, we explicitly compute reg(I(G)s)(I(G)^s) for several subclasses of bipartite graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.