Abstract
Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I. It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a byproduct, we give a method, using Hilbert bases, to compute all irreducible parallelizations of C along with all the corresponding vertex covering numbers.
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.
