The edge rings of compact graphs

Let \(G\) be a \textit{compact graph}. By definition, \(G\) is a connected, simple graph, in which every vertex has a degree greater than one. Furthermore, \(G\) contains no even cycles and satisfies the \textit{odd-cycle condition}. According to a result by Ohsugi and Hibi, the odd-cycle condition is equivalent to saying that the edge ring of \(G\) over a field \(\mathbb{K}\), \(\mathbb{K}[G]\), is a normal domain.\N\NThe authors first provide a combinatorial characterization of compact graphs, showing that such graphs can have at most four vertices with degree exceeding two. Next, they derive universal Gröbner bases for the toric ideals of the edge rings. These bases enable algebraic analysis of the edge rings. Key applications include:\N\begin{itemize}\N\item The projective dimension of the edge ring can be described in terms of the number of induced cycles in \(G\);\N\item The regularity of the edge ring can be associated with the matching number of \(G\).\N\end{itemize}\NThe Eliahou-Kervaire splitting technique is indispensable for dealing with graded Betti numbers in this part. The final section determines the top graded Betti number of the Cohen--Macaulay edge ring \(\mathbb{K}[G]\). In particular, Cohen-Macaulay types can be obtained, which are also related to the number of induced cycles in \(G\).

Cites work

Cited in

(1)

The h -vectors of toric ideals of odd cycle compositions revisited

This page was built for publication: The edge rings of compact graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7000243)