Boolean graphs are unmixed and vertex decomposable
Commutative Algebra
2018-04-04 v4 Combinatorics
Rings and Algebras
Abstract
For each Boolean graph , it is proved that both and its complement graph are vertex decomposable. It is also proved that is an unmixed graph, thus it is also Cohen-Macaulay.
Keywords
Cite
@article{arxiv.1611.07574,
title = {Boolean graphs are unmixed and vertex decomposable},
author = {A-Ming Liu and Tongsuo Wu},
journal= {arXiv preprint arXiv:1611.07574},
year = {2018}
}
Comments
corrected several mistakes and misspells