Abstract
We describe a combinatorial condition on a graph which guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner’s Theorem we study whether all powers of the vertex cover ideal of a Cohen-Macaulay graph have linear free resolutions. After giving a complete characterization of Cohen-Macaulay cactus graphs (i.e., connected graphs in which each edge belongs to at most one cycle) we show that all powers of their vertex cover ideals have linear resolutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
