The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.
1
Department of Pure and Applied Mathematics, Graduate School of Information Science and Technology, Osaka University
2
University of Bucharest
Takayuki Hibi; Dumitru I. Stamate. Nearly Gorenstein rings arising from finite graphs. The electronic journal of combinatorics, Tome 28 (2021) no. 3. doi: 10.37236/10356
@article{10_37236_10356,
author = {Takayuki Hibi and Dumitru I. Stamate},
title = {Nearly {Gorenstein} rings arising from finite graphs},
journal = {The electronic journal of combinatorics},
year = {2021},
volume = {28},
number = {3},
doi = {10.37236/10356},
zbl = {1475.13047},
url = {http://geodesic.mathdoc.fr/articles/10.37236/10356/}
}
TY - JOUR
AU - Takayuki Hibi
AU - Dumitru I. Stamate
TI - Nearly Gorenstein rings arising from finite graphs
JO - The electronic journal of combinatorics
PY - 2021
VL - 28
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/10356/
DO - 10.37236/10356
ID - 10_37236_10356
ER -
%0 Journal Article
%A Takayuki Hibi
%A Dumitru I. Stamate
%T Nearly Gorenstein rings arising from finite graphs
%J The electronic journal of combinatorics
%D 2021
%V 28
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/10356/
%R 10.37236/10356
%F 10_37236_10356
