ABSTRACT
In this chapter we give a description-using notions from combinatorial optimization and polyhedral geometry-of the minimal generators of the symbolic Rees algebra of the edge ideal of a clutter and show a complete graph theoretical description of the minimal generators of the symbolic Rees algebra of the ideal of covers of a graph. For a connected non-bipartite graph G whose edge subring is normal, we give conditions for G to have a perfect matching.
