arXiv · 1210.1336
Cohen-Macaulay $r$-partite graphs with minimal clique cover
Abstract
In this note, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if $G$ is an $r$-partite Cohen-Macaulay graph which is covered by some disjoint cliques of size $r$, then the clique cover is unique.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Asghar Madadi, Rashid Zaare-Nahandi. 2012-10-04. Cohen-Macaulay $r$-partite graphs with minimal clique cover. https://arxiv.org/abs/1210.1336
Cite the original work for its findings. Save a collection to share your selection of sources.