Theory of linear and integer programming
Theory of linear and integer programming
Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
Journal of Combinatorial Optimization
Hi-index | 0.01 |
Let G be a perfect graph and let J be its ideal of vertex covers. We show that the Rees algebra of J is normal and that this algebra is Gorenstein if G is unmixed. Then we give a description---in terms of cliques---of the symbolic Rees algebra and the Simis cone of the edge ideal of G.