Cohen-Macaulay $r$-partite graphs with minimal clique cover
Commutative Algebra
2012-10-05 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1210.1336,
title = {Cohen-Macaulay $r$-partite graphs with minimal clique cover},
author = {Asghar Madadi and Rashid Zaare-Nahandi},
journal= {arXiv preprint arXiv:1210.1336},
year = {2012}
}
Comments
8 pages