Cohen-Macaulay rr-partite graphs with minimal clique cover

preprint2012arXivOpen access

Abstract

In this note, we give some necessary conditions for an rr-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if GG is an rr-partite Cohen-Macaulay graph which is covered by some disjoint cliques of size rr, then the clique cover is unique.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.