arXiv · 2403.16114
Combinatorial properties of strong quasi-n-partite graphs
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Monica La Barbiera, Roya Moghimipor. 2024-03-24. Combinatorial properties of strong quasi-n-partite graphs. https://arxiv.org/abs/2403.16114
Cite the original work for its findings. Save a collection to share your selection of sources.