Vertex Collapsing and Cut Ideals

Details Vertex Collapsing and Cut Ideals Vertex Collapsing and Cut Ideals

2011-10-16

arxiv.org/abs/1110.3480v3

Mathematics

Combinatorics

This paper was started during the Summer School Pragmatic 2011

Scientific paper

In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller ones. To deal with the collapse operation we generalize the definition of cut ideal given in literature, introducing the concepts of edge labeling and edge multiplicity: in fact we state the \emph{non-classical behavior} of the cut ideal. Moreover we show the transformation of the toric map hidden behind these operations.

Affiliated with

Also associated with

No associations

Rating

Vertex Collapsing and Cut Ideals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Vertex Collapsing and Cut Ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Vertex Collapsing and Cut Ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457184