Shellable and Cohen-Macaulay complete t-partite graphs
classification
🧮 math.AC
math.CO
keywords
graphscompletet-partitecohen-macaulayequivalentconditiondecomposabilityfind
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.