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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.