Combinatorial properties of strong quasi-n-partite graphs
Commutative Algebra
2024-03-26 v1
Abstract
Monomial ideals corresponding to strong quasi-n-partite graphs are considered. Some algebraic and combinatorial properties of generalized graph ideals of a strong quasi-n-partite graph are studied. Furthermore, we show that the edge ideal of a strong quasi-n-partite graph is Cohen-Macaulay.
Cite
@article{arxiv.2403.16114,
title = {Combinatorial properties of strong quasi-n-partite graphs},
author = {Monica La Barbiera and Roya Moghimipor},
journal= {arXiv preprint arXiv:2403.16114},
year = {2024}
}