On the ideal theory of graphs (Q1330038)

From MaRDI portal
Revision as of 23:23, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
On the ideal theory of graphs
scientific article

    Statements

    On the ideal theory of graphs (English)
    0 references
    16 August 1994
    0 references
    If \(k\) is a field and \(G\) is a graph on a vertex set \(\{v_ 1, \dots, v_ n\}\), then the edge ideal \(I = I(G) \subset R = k[x_ 1, \dots, x_ n]\) is generated by all \(x_ ix_ j\) such that \(v_ iv_ j\) is an edge of \(G\). We shall assume there are no edges of type \(v_ iv_ i\), so \(I\) is square-free and \(R/I\) is a special case of a face ring of a simplicial complex. Also of interest is \(k[G]\), the subring of \(R\) spanned by the \(x_ ix_ j\). Both algebras can be studied simultaneously by investigation of the Rees algebra \({\mathcal R} (I) = R[I(G)t]\). The main results are the following. The graph \(G\) is bipartite if and only if \(I\) is normally torsion-free (all powers \(I^ m\) have the same associated primes for \(m \geq 1)\). In this case \({\mathcal R} (I)\) is a normal Cohen-Macaulay domain. -- For any graph \(G\), normality of \({\mathcal R} (I)\) implies that \(k[G]\) is also normal; the converse holds if for each \(m\), the integral closure of \(\{I^ m\}\) is generated by monomials of a single degree. If \(G\) is a tree, then \(I(G)\) has the sliding depth property, and in particular \(I\) is strongly Cohen-Macaulay if it is Cohen-Macaulay. Separate arguments establish the normality of \({\mathcal R} (I)\) for a number of special cases: \(G\) an even cycle, \(G\) an odd cycle, \(G\) a complete graph. Along the way, the authors develop techniques of independent interest on the preservation of the Cohen-Macaulay property under ``glueing'' of Rees algebras.
    0 references
    monomial ideal
    0 references
    edge ideal
    0 references
    face ring of a simplicial complex
    0 references
    Rees algebras
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references