Monomial ideals of weighted oriented graphs (Q2323821): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1710.03785 / rank | |||
Normal rank | |||
Revision as of 04:17, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monomial ideals of weighted oriented graphs |
scientific article |
Statements
Monomial ideals of weighted oriented graphs (English)
0 references
12 September 2019
0 references
Summary: 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\).
0 references
Cohen-Macaulay property
0 references
