可分层图
Levelable graphs
AI总结:
该研究定义了与交换代数中分层阿廷环相关的可分层图,分析其性质并对部分图族分类,结合相关结果证明多数图的边理想非Cohen–Macaulay。
摘要:
我们研究一类正赋权的well-covered图,将其称为可分层图,这类图与交换代数中分层阿廷环的构造相关。图G是可分层图,当且仅当存在顶点上的正整数值权重函数,使得G关于该权重函数是well-covered图,即G的任意极大独立集的权重和相等。我们描述了可分层图的一些基本性质,并对若干图族的可分层图进行分类,例如树、立方循环图、Cameron–Walker图。我们还解释了可分层图与一类分层阿廷环之间的联系。应用Brown和Nowakowski关于赋权well-covered图的结果,我们证明了对于大多数图,其边理想不是Cohen–Macaulay的。
英文摘要:
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with positive integer values on the vertices of $G$ such that $G$ is well-covered with respect to this weight function. That is, the sum of the weights in any maximal independent set of vertices of $G$ is the same. We describe some of the basic properties of levelable graphs and classify the levelable graphs for some families of graphs, e.g., trees, cubic circulants, Cameron--Walker graphs. We also explain the connection between levelable graphs and a class of level artinian rings. Applying a result of Brown and Nowakowski about weighted well-covered graphs, we show that for most graphs, their edge ideals are not Cohen--Macaulay.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。