We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.
The arithmetical rank of the edge ideals of graphs with pairwise disjoint cycles
BARILE, Margherita;
2016-01-01
Abstract
We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Ara_disjoint_cycles.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
346.7 kB
Formato
Adobe PDF
|
346.7 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
