Cohen-Macaulayness of bipartite graphs, revisited

Details Cohen-Macaulayness of bipartite graphs, revisited Cohen-Macaulayness of bipartite graphs, revisited

2010-12-02

arxiv.org/abs/1012.0457v2

Mathematics

Commutative Algebra

7 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cohen-Macaulayness of bipartite graphs, revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cohen-Macaulayness of bipartite graphs, revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cohen-Macaulayness of bipartite graphs, revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603929