The v-number of edge ideals

Journal of Combinatorial Theory, Series A(2021)

引用 5|浏览14
暂无评分
摘要
The aim of this work is to study the v-number of edge ideals of clutters. We relate the v-number with the regularity of edge ideals and classify W2 graphs. If the edge ideal of a graph has second symbolic power Cohen–Macaulay, we show that the graph is edge-critical.
更多
查看译文
关键词
v-number,Edge-critical graphs,Edge ideals,Regularity,W2 graphs,Symbolic powers,Cohen–Macaulay ideals
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要