Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four

DOI10.1007/S40995-020-00961-WMaRDI QIDQ6329880zbMATH OpenFDO

Authors Mohammad Reza Oboudi, Ashkan Nikseresht

Publication date 26 November 2019

Full work available at URL https://doi.org/10.1007/S40995-020-00961-W

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)

Abstract: Let $alpha=alpha(G)$ be the independence number of a simple graph $G$ with $n$ vertices and $I(G)$ be its edge ideal in $S=K[x_1,ldots,x_n]$. If $S/I(G)$ is Gorenstein, the graph $G$ is called Gorenstein over $K$ and if $G$ is Gorenstein over every field, then we simply say that $G$ is Gorenstein. In this article, first we state a condition equivalent to $G$ being Gorenstein and using this we give a characterization of Gorenstein graphs with $alpha=2$. Then we present some properties of Gorenstein graphs with $alpha=3$ and as an application of these results we characterize triangle-free Gorenstein graphs with $alpha=3$.

This page was built for publication: Some Combinatorial Characterizations of Gorenstein Graphs with Independence Number Less than Four

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