  Associated to any graph is a toric ideal whose generators record relations
among the cuts of the graph. We study these ideals and the geometry of the
corresponding toric varieties. Our theorems and conjectures relate the
combinatorial structure of the graph and the corresponding cut polytope to
algebraic properties of the ideal. Cut ideals generalize toric ideals arising
in phylogenetics and the study of contingency tables.
