TY - JOUR AU - Dupont, Luis A. AU - Villarreal, Rafael H. PY - 2010/03/01 Y2 - 2024/03/28 TI - Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals JF - MATHEMATICA SCANDINAVICA JA - Math. Scand. VL - 106 IS - 1 SE - Articles DO - 10.7146/math.scand.a-15126 UR - https://www.mscand.dk/article/view/15126 SP - 88-98 AB - The normality of a monomial ideal is expressed in terms of lattice points of blocking polyhedra and the integer decomposition property. For edge ideals of clutters this property characterizes normality. Let $G$ be the comparability graph of a finite poset. If $\mathrm{cl}(G)$ is the clutter of maximal cliques of $G$, we prove that $\mathrm{cl}(G)$ satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. Then we prove that edge ideals of complete admissible uniform clutters are normally torsion free. ER -