Cohen-Macaulay -partite graphs with minimal clique cover
arXiv:1210.1336
Abstract
In this note, we give some necessary conditions for an -partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if is an -partite Cohen-Macaulay graph which is covered by some disjoint cliques of size , then the clique cover is unique.
8 pages