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
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$, …