We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved. Moreover, we show that the edge ideal of a Cohen- Macaulay graph that contains exactly one cycle or is chordal or has no cycles of length 4 and 5 is a set-theoretic complete intersection.

The arithmetical rank of the edge ideals of cactus graphs

BARILE, Margherita;MACCHIA, ANTONIO
2017-01-01

Abstract

We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved. Moreover, we show that the edge ideal of a Cohen- Macaulay graph that contains exactly one cycle or is chordal or has no cycles of length 4 and 5 is a set-theoretic complete intersection.
File in questo prodotto:
File Dimensione Formato  
The arithmetical rank of the edge ideals of cactus graphs.pdf

non disponibili

Tipologia: Documento in Versione Editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 514.86 kB
Formato Adobe PDF
514.86 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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/185094
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact