Combinatorics of the integral closure of edge ideals of strong quasi-n-partite graphs
Abstract
Combinatorial properties of some ideals related to strong quasi-n-partites graphs are examined. We prove that the edge ideal of a strong quasi-n-partite graph is not integrally closed and we give an expression for its integral closure. Moreover, we are able to determine the structure of the ideals of vertex covers for the edge ideals associated to a strong quasi-n-partite graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.