Abstract
Let be a field and be the polynomial ring in variables over . Let be a graph with vertices. Assume that is the edge ideal of and is its cover ideal. We prove that and , where is the ordered matching number of . We also prove the inequalities and , for every integer , when is a bipartite graph. Moreover, we provide an elementary proof for the known inequality .
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.