arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.0457math.AC
收藏

二部图的Cohen-Macaulay性

Cohen-Macaulayness of bipartite graphs, revisited

Rashid Zaare-Nahandi

摘要:

二部图的Cohen-Macaulay性是由几个数学家研究的,并已得到了组合刻画。本文给出了二部图的Cohen-Macaulay性的几个不同的组合条件。在以前的作品中的条件是依赖于一个适当的排序图的顶点。本文中提出的条件不依赖于任何排序。最后,我们给出了一个判定给定二部图的Cohen-Macaulay性的快速算法。

英文摘要:

Cohen-Macaulayness of bipartite graphs is investigated by several mathematicians and has been characterized combinatorially. In this note, we give some different combinatorial conditions for a bipartite graph which are equal to Cohen-Macaulayness of the graphs. Conditions in the previous works are depending on an appropriate ordering on vertices of the graph. The conditions presented in this paper are not depending to any ordering. Finally, we present a fast algorithm to check Cohen-Macaulayness of a given bipartite graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑