Herzog, Hibi and Ohsugi conjecture for trees
Ajay Kumar, Rajiv Kumar

TL;DR
This paper proves Herzog, Hibi and Ohsugi's conjecture for trees, showing all powers of vertex cover ideals of trees are componentwise linear, and extends results to certain unicyclic graphs.
Contribution
It establishes the conjecture for trees and identifies conditions under which symbolic powers of vertex cover ideals are componentwise linear in unicyclic graphs.
Findings
All powers of vertex cover ideals of trees are componentwise linear.
Symbolic powers of vertex cover ideals are componentwise linear for certain unicyclic graphs.
The conjecture holds for a broader class of graphs under specific conditions.
Abstract
Let be a polynomial ring, where is a field, and be a simple graph on vertices. Let be the vertex cover ideal of . Herzog, Hibi and Ohsugi have conjectured that all powers of vertex cover ideals of chordal graph are componentwise linear. Here we establish the conjecture for the special case of trees. We also show that if is a unicyclic vertex decomposable graph that does not contain or , then symbolic powers of are componentwise linear.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Graph theory and applications · Algebraic structures and combinatorial models
