Cohen-Macaulay r-partite graphs with minimal clique cover

zbMATH Open1302.05078arXiv1210.1336MaRDI QIDQ464550FDOQ464550

Authors: Asghar Madadi, Rashid Zaare-Nahandi 

Publication date: 27 October 2014

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1210.1336

Recommendations

• A note on Cohen-Macaulay graphs
• Bipartite \(S_2\) graphs are Cohen-Macaulay
• Certain classes of Cohen-Macaulay multipartite graphs
• Cohen-Macaulay bipartite graphs in arbitrary codimension
• Cohen-Macaulayness of bipartite graphs, revisited

zbMATH Keywords

clique cover\(r\)-partiteCohen-Macaulay graphperfect \(r\)-matching

Mathematics Subject Classification ID

Combinatorial aspects of commutative algebra (05E40) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cited In (1)

• Monomial ideals of weighted oriented graphs

This page was built for publication: Cohen-Macaulay \(r\)-partite graphs with minimal clique cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464550)