Monomial Ideals of Weighted Oriented Graphs

  • Yuriko Pitones
  • Enrique Reyes
  • Jonathan Toledo


Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$ whose underlying graph is $G$. We determine the irredundant irreducible decomposition of $I$. Also, we characterize the associated primes and the unmixed property of $I$. Furthermore, we give a combinatorial characterization for the unmixed property of $I$, when $G$ is bipartite, $G$ is a graph with whiskers or $G$ is a cycle. Finally, we study the Cohen–Macaulay property of $I$.

Article Number