Shellable and Cohen-Macaulay complete t-partite graphs
Commutative Algebra
2012-05-29 v2 Combinatorics
Abstract
Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent condition for Cohen-Macaulay in complete t-partite graphs.
Keywords
Cite
@article{arxiv.1204.2112,
title = {Shellable and Cohen-Macaulay complete t-partite graphs},
author = {Seyyede Masoome Seyyedi and Farhad Rahmati and Mahdis Saeedi},
journal= {arXiv preprint arXiv:1204.2112},
year = {2012}
}
Comments
6 pages