Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals

Details Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals

2008-05-25

arxiv.org/abs/0805.3838v2

S\~ao Paulo J. Math. Sci. {\bf 3 (2009), no. 1, 61-75

Mathematics

Commutative Algebra

The Sao Paulo Journal of Mathematical Sciences, to appear

Scientific paper

Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp. max-flow min-cut property) such that C is a minor of C1. For arbitrary edge ideals of clutters we prove that the normality property is closed under parallelizations. Then we show some applications to edge ideals and clutters which are related to a conjecture of Conforti and Cornu\'ejols and to max-flow min-cut problems.

Affiliated with

Also associated with

No associations

Rating

Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge 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 Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-437454