Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals

Details Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals

2008-02-22

arxiv.org/abs/0802.3375v2

Math. Scand. 106 (2010), no. 1, 88--98

Mathematics

Commutative Algebra

Math. Scand., to appear

Scientific paper

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that edge ideals of complete admissible uniform clutters are normally torsion free. The normality of a monomial ideal is expressed in terms of blocking polyhedra and the integer decomposition property. For edge ideals of clutters this property completely determine their normality

Affiliated with

Also associated with

No associations

Rating

Edge ideals of clique clutters of comparability graphs and the normality of monomial 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 Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-303631