Combinatorial properties of strong quasi-n-partite graphs

2024/03/24 by La Barbiera, Monica, Moghimipor, Roya
#05B35 #05C75 #13C14 #13F20 #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.2403.16114

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.

Related

• Combinatorics of the integral closure of edge ideals of strong quasi-n-partite graphs
• Monomial ideals whose all matching powers are Cohen-Macaulay
• Combinatorial characterizations of the Cohen-Macaulayness of the second power of edge ideals
• Multiplicity Bounds for Quadratic Monomial Ideals
• Quasi f-Simplicial Complexes and Quasi f-Graphs