ON GRAPHS, THAT ARE NOT EQUATIONALLY NOETHERIAN

被引：1
|
作者：
Buchinskiy, Ivan Mikhailovich [1 ]
Treyer, Alexander Viktorovich [1 ]
机构：
[1] Sobolev Inst Math, Omsk Branch, Pevtsova St 13, Omsk 644043, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2023年 / 20卷 / 02期
关键词：
simple graphs; graphs with loops; graph groups; equationally noetherian; one variable equations;
D O I：
10.33048/semi.2023.20.033
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The goal of the paper is to describe all equationally noetherian graphs in terms of forbidden subgraphs for the categories of simple graphs and graphs with loops.
引用
收藏
页码：580 / 587
页数：8
相关论文
共 50 条
12345