Levelness versus almost Gorensteinness of edge rings of complete multipartite graphs

被引:5
作者
Higashitani, Akihiro [1 ]
Matsushita, Koji [1 ]
机构
[1] Osaka Univ, Grad Sch Informat Sci & Technol, Dept Pure & Appl Math, Suita, Osaka, Japan
关键词
Level; almost Gorenstein; edge rings; complete multipartite graphs; POLYTOPES;
D O I
10.1080/00927872.2021.2015362
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Levelness and almost Gorensteinness are well-studied properties on graded rings as a generalized notion of Gorensteinness. In the present paper, we study those properties for the edge rings of the complete multipartite graphs, denoted by k[K-r1,..,r(n)] with 1 <= r(1) <= . . . <= r(n). We give the complete characterization of which k[K-r1,...,r(n)] is level in terms of n and r(1),...,r(n) Similarly, we also give the complete characterization of which k[K-r1,...,r(n)] is almost Gorenstein in terms of n and r(1),...,r(n).
引用
收藏
页码:2637 / 2652
页数:16
相关论文
共 38 条
  • [31] The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency
    Dalal, Aseem
    Rodger, C. A.
    GRAPHS AND COMBINATORICS, 2015, 31 (06) : 2159 - 2173
  • [32] On choosability of some complete multipartite graphs and Ohba's conjecture
    Shen, Yufa
    He, Wenjie
    Zheng, Guoping
    Wang, Yanning
    Zhang, Lingmin
    DISCRETE MATHEMATICS, 2008, 308 (01) : 136 - 143
  • [33] The competition numbers of complete multipartite graphs with many partite sets
    Kim, Suh-Ryung
    Park, Boram
    Sano, Yoshio
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1176 - 1182
  • [34] Complete multipartite graphs that are determined, up to switching, by their Seidel spectrum
    Berman, Abraham
    Shaked-Monderer, Naomi
    Singh, Ranveer
    Zhang, Xiao-Dong
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2019, 564 : 58 - 71
  • [35] Edge rings of bipartite graphs with linear resolutions
    Tsuchiya, Akiyoshi
    JOURNAL OF ALGEBRA AND ITS APPLICATIONS, 2021, 20 (09)
  • [37] On the (S2)-condition of edge rings for cactus graphs
    Dinu, Rodica
    Deepthi, Nayana Shibu
    COMMUNICATIONS IN ALGEBRA, 2025,
  • [38] Choice number of complete multipartite graphs K3*3,2*(k-5), 1*2 and K4,3*2,2*(k-6), 1*3
    He, Wenjie
    Zhang, Lingmin
    Cranston, Daniel W.
    Shen, Yufa
    Zheng, Guoping
    DISCRETE MATHEMATICS, 2008, 308 (23) : 5871 - 5877