Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals (Q746809)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals |
scientific article |
Statements
Combinatorial characterizations of the saturation and the associated primes of the fourth power of edge ideals (English)
0 references
20 October 2015
0 references
Let \(G\) be a graph and \(I=I(G)\) its edge ideal. The authors classify all the \(4\)-saturated weighted graphs. By using the relation between \(t\)-saturated weighted graphs and saturation of \(I^t\), the authors describe the generators of the saturation od \(I^4\). Moreover, they also give a combinatorial characterization of associated primes of \(I^4\).
0 references
edge ideal
0 references
power
0 references
associated prime
0 references
depth
0 references
dominating subgraph
0 references
odd cycle
0 references
0 references
0 references
0.8602993488311768
0 references
0.8407697677612305
0 references
0.7530859708786011
0 references
0.7496106624603271
0 references
0.7444573044776917
0 references