Abstract
Let be a finite simple graph and denote the corresponding edge ideal. For all , we obtain upper bounds for reg for bipartite graphs. We then compare the properties of and , where is the graph associated with the polarization of the ideal , where are edges of . Using these results, we explicitly compute reg for several subclasses of bipartite graphs.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.