WorksMathematics
Associated primes and v-numbers of integral closures of powers of edge ideals
Abstract
Let be the edge ideal of a finite simple graph . We investigate the relationship between the associated primes and -numbers of powers and their integral closures . For the third power, we establish the associated prime containment , which yields . In contrast, for , we show that and are in general incomparable. Furthermore, for every fixed and , we construct families of graphs for which the discrepancies and are arbitrarily large.
Introduction
Let be a standard graded polynomial ring over a field , and let be a nonzero homogeneous ideal. For an associated prime , the local -number of at is defined by
The -number of , introduced by Cooper et al. [4] in connection with the minimum distance function of projective Reed–Muller-type codes, is given by
The -number of edge ideals was studied by Jaramillo and Villarreal [10]. Conca [3] and Ficarra and Sgroi [7] established the eventual linearity of the -numbers of ordinary powers of homogeneous ideals. More recently, Ficarra and Sgroi [8] studied the -function of Noetherian graded filtrations and proved its eventual quasi-linearity, including for integral closure filtrations.
Vanmathi A and Sarkar [17] investigated the -numbers of integral closures of powers of monomial ideals. Biswas, Mandal, and Phukan [1] showed that the -numbers of a monomial ideal and its integral closure need not be comparable. They also proved that if is a connected graph, then for , and obtained an eventual comparison for disconnected graphs. In this paper, we investigate the relationship between and at individual powers. Since for , the third power is the first instance where the two ideals, and consequently their associated primes and -numbers, can diverge.
On the associated prime side, Trung [16] studied the stability of the associated primes of integral closures of powers of monomial ideals. For edge ideals, Martínez-Bernal, Morey, and Villarreal [12] showed that the eventual stable sets of associated primes of ordinary powers and their integral closures coincide, while Mau and Trung [13] obtained bounds for the stability indices of associated primes of integral closures. In contrast to the combinatorial description of associated primes of ordinary powers given by Lam and Trung [11], a general description of for arbitrary graphs and powers is not available.
Because the -number is defined in terms of associated primes, we first investigate their relationship for ordinary powers and their integral closures. We also compare the first powers at which the homogeneous maximal ideal becomes an associated prime. Our main contributions are organized as follows:
Local equality at minimal primes. For every minimal prime and every , we prove that the local -numbers coincide:
Containment and inequality for the third power. For , we prove that
and
Incomparability for higher powers. For every fixed integer , we show that and are, in general, incomparable under set inclusion. Moreover, the first power at which the homogeneous maximal ideal becomes associated to an integral closure can be arbitrarily smaller than the corresponding first power for ordinary powers.
Arbitrarily large gaps for higher powers. For every fixed integer and any integer , we construct families of graphs for which the discrepancy
Furthermore, for , we show that the reverse difference can also be made arbitrarily large.
Acknowledgment. Chau gratefully acknowledges that this research was supported in part by the Pacific Institute for the Mathematical Sciences and a grant from the Simons Foundation International [SFI-MPS-T-Institutes-00020822, OY]. Hà is partially supported by a Simons Foundation grant. u is partially supported by the National Foundation for Science and Technology Development under grant number Nafosted/101/10104/2026/1279.
AI Disclosure. Theorem 4.5 was proved by ChatGPT-6.1 Sol in the case and generalized by the authors.
Preliminaries
We collect the graph-theoretic notation and the criterion for membership in the integral closure that will be used throughout the paper.
Definition 2.1. Let be a simple graph with vertex set and edge set .
A simple graph is a subgraph of if and . It is an induced subgraph of if .
For a subset , we denote by and the induced subgraphs of on and on , respectively.
For a vertex , denotes the set of neighbors of . For a subset , denotes the neighborhood of , and denotes the closed neighborhood of .
A subset is called an independent set if no two vertices in are adjacent in . We denote by the maximum size of an independent set of .
A subset is called a vertex cover (or simply a cover) of if it meets every edge of ; that is, for all .
A graph is called bipartite if its vertex set can be partitioned as with such that every edge in has one endpoint in and the other in .
(7) A graph is called strongly non-bipartite if each of its connected components is non-bipartite.
(8) An edge of is called a bridge if its removal increases the number of connected components by one.
(9) A matching in is a set of pairwise non-adjacent edges. The matching number of , denoted by , is the size of a maximum matching of . A perfect matching is a matching that covers every vertex of .
(10) A graph is called factor-critical if has a perfect matching for every .
Throughout this paper, we denote by the polynomial ring over a field , and by its maximal homogeneous ideal. For a nonzero monomial , its support, denoted by , is the set of all variables in that divide . For each , we denote by the exponent of in , and by the total degree of . For any subset , we define
Definition 2.2. Let be a simple graph on and let be a vector of positive integers. The parallelization of with respect to , denoted by , is the graph obtained by replicating each vertex into copies, denoted , such that if and only if .
For the subsequent arguments, we use the fractional matching number with capacity and its dual formulation.
Definition 2.3. Let be a simple graph with , and let be an exponent vector. The fractional matching number of with capacity is defined as
We have the following membership criterion in terms of , see [9 Proposition 1.1].
Lemma 2.4. Let be a simple graph and let . Then if and only if .
Let be the covering polyhedron of , namely
By linear programming duality, can also be expressed as the optimal value of the dual problem:
Associated primes of ordinary powers and their integral closures
In this section, we investigate associated primes of powers of an edge ideal and their integral closures. Our first result establishes a containment of associated primes for the third power.
Theorem 3.1. Let be the edge ideal of a simple graph . If is a monomial such that is a prime ideal, then . In particular,
Proof. By [14 Theorem 2.10],
where , and form an exceptional pair if . Set , and suppose that is a monomial prime ideal. Since , we have .
Assume for contradiction that there exists a variable such that . Then , so is divisible by for some exceptional pair of triangles . Write and . Since , the square-free monomial cannot divide . Thus and . Furthermore, and : otherwise or , respectively, would be three edges whose product divides .
We claim that . Otherwise, since and occurs to exponent one in , any product of three edges dividing must use both copies of . At most one of these edges can be , since also occurs to exponent one in . As and no vertex of is adjacent to , at least one of the two edges incident to must be for some . But then the product of the three edges divides , a contradiction. By symmetry, .
The monomials and have the same support as . Every generator in the above description of is square-free. Therefore, if an exceptional generator divided or , it would also divide , which is impossible. We conclude that , and hence . But contains , so it is a vertex cover prime of . This contradicts .
Thus , and equality follows. Finally, choose with and . We obtain for every , which gives the asserted containment and inequality. □
We next give a criterion for the homogeneous maximal ideal to be an associated prime of the integral closure of a power. We first show that every monomial witness for the maximal ideal has a fixed degree.
Lemma 3.2. Let be a simple graph and . Suppose that is a monomial such that . Then .
Proof. By Lemma 2.4,
Let be an optimal extreme point of the covering polyhedron for . We claim that for all . Indeed, if , then
a contradiction.
Let be the spanning subgraph of whose edges are those satisfying . Every connected component of must contain an odd cycle. Otherwise, a bipartite component, including the possibility of an isolated vertex, would allow us to perturb by small positive and negative multiples of the vector taking the values and on its two parts and zero elsewhere. Since all coordinates of are positive, the nonnegativity inequalities remain satisfied; the tight edge inequalities are unchanged, and the remaining inequalities remain satisfied for sufficiently small perturbations. This contradicts the fact that is an extreme point of .
On each connected component of , the tight equalities, together with an odd cycle, force at every vertex. Hence , and therefore
On the other hand, for any vertex , the same feasible dual vector gives
Since is an integer, these inequalities imply .
The following criterion strengthens the necessary condition in Lemma 3.2 and its converse. For a subset , we write .
Lemma 3.3. Let be a simple graph, let , and let be a monomial. Then if and only if and
for every nonempty independent set .
Proof. Suppose that . By Lemma 3.2, . Let be a nonempty independent set and choose . Since , there exists a fractional matching with capacity and total weight at least . As , its total weight must be exactly , and all vertex capacities are saturated. Since no edge has both endpoints in , all capacity used at vertices of must be matched with vertices of . Thus
Conversely, assume that and that the stated inequalities hold. In particular, by degree. Fix and put . By Lemma 2.4, it is enough to show that .
The assumed inequalities imply that has no isolated vertices. Let be an extreme point of . By [5 Lemma 4.5], every coordinate of belongs to . Set
The set is independent and . Since , we have
If , then and . If , the hypothesis gives , and again . Thus the dual objective is at least at every extreme point of . By linear programming duality, .
It follows that for every vertex . Since , we have , as desired.
As an immediate consequence, we recover the following sufficient condition, which will also be used in the next section.
Lemma 3.4. Let be a graph on an odd number of vertices and assume that
for every nonempty independent set . Let , let be the homogeneous maximal ideal of , and set . Then
Proof. Take . Then , and the inequalities in Lemma 3.3 are precisely the assumed strict inequalities. Thus .
We recall the generalized ear decompositions and invariants of Lam and Trung [11], which will be used to compare the associated primes of ordinary powers.
Definition 3.5. A generalized ear decomposition of a graph is a sequence of walks in such that the first walk is closed, the endpoints of each subsequent walk belong to earlier walks, and every vertex of appears exactly once as an inner point of . A vertex is an inner point if it is neither the last vertex of the first walk nor an endpoint of any subsequent walk; we count the first vertex of the first walk as an inner point. A generalized ear decomposition is odd-beginning if the first walk in each connected component is an odd cycle.
Definition 3.6. For a strongly non-bipartite graph , let be the minimum number of even walks in odd-beginning generalized ear decompositions of its connected components, and set
where denotes the number of connected components of .
We will use the criterion [11 Theorem 3.6]: if and only if there exists a dominating set such that is strongly non-bipartite and . We will also use [11 Lemma 3.9], which gives when is strongly non-bipartite and is a leaf.
Lemma 3.7. Let be a connected graph and let be a bridge of . Then every generalized ear decomposition of contains the closed walk of length two along .
Proof. Let and be the components of , and suppose that the first walk of a generalized ear decomposition lies in . This is automatic unless the first walk is the closed walk of length two along , in which case there is nothing to prove. Let be the first walk using . Before , all vertices that have appeared lie in , so both endpoints of lie in . The walk must cross into and return along . Since its inner vertices are new and distinct, it can contain no additional vertices between the two crossings, and it must be the closed walk of length two along . The same argument applies if the first walk lies in .
We can now construct examples for which an integral closure has the maximal ideal as an associated prime while the corresponding ordinary power does not.
Theorem 3.8. For every integer , there exists a simple graph such that
Proof. Fix and set . Let and be disjoint odd cycles, and let be a vertex joined to one vertex of each cycle. Denote by the graph on . Let be obtained from by attaching one leaf to every vertex of . Thus . Consider the monomial
Since , we have . We claim that for every vertex of . If belongs to one of the odd cycles, we may use the two edges of that cycle incident to , together with a perfect matching of the remaining vertices of that cycle. The other odd cycle, together with , has a perfect matching. These edges give edge factors dividing . If is the leaf attached to a vertex of either cycle, then has a perfect matching of size . Together with the edge , this gives edge factors dividing . If , we use the two edges joining to the two cycles and perfect matchings of the even paths obtained by deleting their neighbors from the cycles. Again, the product of these edges divides . Finally, if is the leaf attached to , assign fractional matching weight to the edge and weight to every edge of the two odd cycles. This is a fractional matching with capacity given by the exponent vector of and total weight
By Lemma 2.4, in this last case as well. Hence .
It remains to prove that . Let be a dominating set of such that is strongly non-bipartite. We claim that . Indeed, if , its attached leaf must belong to in order to be dominated. That leaf would then be an isolated vertex of , a contradiction.
Thus is obtained from by adding some of its leaves. By [11 Lemma 3.9], . The two edges joining to the cycles are bridges. By Lemma 3.7, every generalized ear decomposition of has at least two even walks. Conversely, begin with one odd cycle, add the two bridge edges as closed walks of length two, and then add the other odd cycle. This gives an odd-beginning generalized ear decomposition with exactly two even walks. Therefore , and
Consequently, for every such dominating set . By [11 Theorem 3.6], . □
We now compare the first powers for which the maximal ideal becomes an associated prime. Set
For an integer , let be the graph obtained from the path
by completing and to two triangles. Thus we add vertices and the six edges
The graph has vertices.
Figure 1. The graph : two triangles joined by a path of length .
We first verify the strict Hall condition on .
Lemma 3.9. For every and every nonempty independent set ,
Moreover, if , then .
Proof. Let , and put . An independent set of , with , has at least neighbors in , by choosing one vertex strictly between each two consecutive vertices of . If avoids both endpoints, it has at least neighbors in . If contains exactly one endpoint, it has at least neighbors in .
Let be the number of vertices of among and let . Since is independent, at most one of and at most one of belongs to , and none of these outer vertices belongs to when the corresponding path endpoint is in .
If and , the selected outer vertices contribute distinct neighbors outside , so
If , each selected path endpoint contributes two neighbors outside , and each selected outer vertex contributes its partner in its triangle. Thus
If , the stronger bound gives . If , the preceding bound already gives . This proves the additional assertion when . Finally, if , the selected outer vertices have disjoint neighborhoods of size two, giving . □
Lemma 3.10. For every , .
Proof. Every edge of the connecting path is a bridge, so Lemma 3.7 shows that an odd-beginning generalized ear decomposition of has at least even walks. Conversely, begin with the triangle , add the closed walks for , and finish with the triangle . This is an odd-beginning generalized ear decomposition with exactly even walks. □
Lemma 3.11. For every , .
Proof. By [11 Theorem 3.6], it suffices to prove that
Let be such a dominating set and put . Since the only odd cycles of are its two endpoint triangles, has at most two connected components. By repeated application of [11 Lemma 3.9], a triangle with an attached path of length has
If has two connected components, both endpoint triangles are contained in . The vertices of on the connecting path form a prefix and a suffix . The omitted middle block has length , where by domination. Hence
The value is attained by omitting two consecutive internal vertices of the connecting path.
If is connected and contains only one endpoint triangle, it must contain the entire connecting path and possibly one further vertex of the opposite endpoint triangle. It is therefore a triangle with a path of length or attached, so . Finally, if is connected and contains both endpoint triangles, then , and Lemma 3.10 gives
Taking the minimum gives the claimed formula. □
The integral closure first appearance index can also be determined exactly.
Lemma 3.12. For every integer ,
Proof. First suppose that is even. By Lemmas 3.9 and 3.4, the product of all variables is a witness for the maximal ideal of . If is odd, take the same product multiplied by . The additional assertion of Lemma 3.9 shows that its exponent vector satisfies the inequalities of Lemma 3.3, and its total degree is . It is therefore a witness for . In both cases we obtain
To prove the reverse inequality, let be a monomial such that , and set . By Lemma 3.3, is a dominating set. Moreover, each connected component of is non-bipartite. Indeed, if such a component had bipartition , both parts would be independent, and all neighbors of and outside this component would have exponent zero. The inequalities in Lemma 3.3 would therefore give and , a contradiction. The same argument with a singleton rules out an isolated vertex.
We need a bound for the weight of a component of consisting of a triangle with an attached path , where is a vertex of the triangle. We claim that
This is clear if . Suppose . For , the set is independent. Its neighbors of positive exponent are precisely the alternate vertices . Thus Lemma 3.3 gives
Since , it follows that for . The other two vertices of the triangle have positive exponents. This proves .
Since has only the two endpoint triangles, the strongly non-bipartite graph has at most two connected components. If it is connected and contains both triangles, then , so . If it is connected and contains only one triangle, it is a triangle with an attached path of length or . Hence .
Finally, suppose that has two components. Both endpoint triangles then belong to , and the vertices omitted from the connecting path form a block of length by domination. If the two attached paths have lengths and , then . Applying the preceding estimate to the two components yields
where the last inequality holds for .
Thus in all cases. Lemma 3.2 gives , so . This proves the formula. □
Theorem 3.13. For every integer , there exists a graph such that
Proof. Take and let . By Lemma 3.11, , while Lemma 3.12 gives . Hence
as claimed. □
Remark 3.14. Martínez-Bernal, Morey, and Villarreal showed that the ordinary and integral closure associated prime filtrations have the same eventual stable set, while their Example 3.9 shows that the two stability indices may differ [12]. Theorem 3.13 gives a stronger first appearance phenomenon: the maximal ideal may occur in an integral closure arbitrarily earlier than in the corresponding ordinary powers.
The reverse difference can also be made arbitrarily large. We first compute both indices for disjoint unions of triangles.
Lemma 3.15. Let be the disjoint union of triangles. Then
Proof. Let be the product of all variables of . Each triangle contributes one edge factor to , whereas multiplying by any variable allows two edge factors in the corresponding triangle. Thus and .
Conversely, suppose that . The matching capacity of is , and it is the sum of the matching capacities on the triangles. Each triangle must have positive matching capacity: if its support contained at most one vertex, multiplying by a variable already in that support (or by any variable if the support is empty) would not increase its matching capacity, contradicting the colon condition. Hence , and .
Now suppose that . For a triangle with vertices , Lemma 3.3 gives
These inequalities force all three exponents to be positive. Indeed, if , the last two inequalities would give simultaneously and . Thus . By Lemma 3.2, this degree is odd. When is odd, it follows that . When is even, no triangle can have total weight four: up to permutation, the only positive integer triple with sum four is , which violates one of the displayed inequalities. Consequently, the smallest possible odd total degree is .
These lower bounds are attained. If is odd, take all exponents equal to one. If is even, take exponents on one triangle and on all the others. In each case the inequalities of Lemma 3.3 hold on every triangle, hence on their disjoint union. The stated values of follow. □
Theorem 3.16. For every integer , there exists a graph such that
Proof. Take . By Lemma 3.15,
Their difference is , as required. □
In particular, neither of the two associated prime containments holds for all graphs when is fixed. Indeed, Theorem 3.8 supplies one direction. For the other, take . Then , while Lemma 3.15 gives . Thus but .
Comparison of v-numbers
This section is devoted to the study of -numbers of powers of an edge ideal and their integral closures. We start with a result for general squarefree monomial ideals.
Lemma 4.1. Let be a squarefree monomial ideal and let be a minimal prime of . Then, for every ,
Proof. If , the assertion is immediate. We may therefore assume that . Let be a monomial such that . Since is squarefree and is a minimal prime, . Localizing the colon equality at gives , which implies that .
Let with . Choose a variable . Since and is -primary, we have . It follows that
Since , we obtain
Thus , proving the assertion. □
When is the edge ideal of a graph, we have the following stronger result.
Theorem 4.2. Let be a simple graph and let be its edge ideal. Then, for every , every minimal prime , and every monomial , we have
In particular,
To establish Theorem 4.2, we need the following lemma.
Lemma 4.3. Let be the edge ideal of a simple graph , and let be a vertex cover of . Let be a monomial of such that and . Then .
Proof. Since , there exist positive rational numbers and minimal generators of such that and . Because and for every , it follows that for all .
Thus each is a product of edges having exactly one endpoint in . Let be the edge ideal of the bipartite graph consisting of the edges of between and . Then for all , and hence . Since is the edge ideal of a bipartite graph, it is normal (see [15]), i.e., . Therefore .
Proof of Theorem 4.2. If , the assertion is immediate. We may therefore assume that . Let be the minimal vertex cover corresponding to . We first observe that if is a monomial such that , where is either or , then
Indeed, , as is integrally closed. Since for every , we have . Suppose that . Choose variables, counted with multiplicity, from whose product divides . Because is a minimal vertex cover, each of these variables has a neighbor outside . Let be the product of these neighbors, counted with multiplicity. Then and , contradicting . This proves the observation.
Now suppose that . Since and , we have
Thus .
Conversely, suppose that . For each variable , we have and . Lemma 4.3 gives . Consequently,
so . The equality of the local -numbers follows.
We now show that the difference can be arbitrarily large for any fixed integer , while the difference can grow linearly in .
Theorem 4.4. For any fixed integer and any positive integer , there exists a graph such that
Proof. Let be the graph consisting of a base triangle together with triangles attached to each of its vertices. Define to be the disjoint union of copies of , and set .
Let be the product of all variables corresponding to the base triangles in . Then and , since each base triangle contributes at most one edge factor to . However, for every variable . Indeed, in the component containing , the monomial admits two edge factors, while the remaining base triangles each supply one edge factor. Thus , giving
We also have . Indeed, assigning weight to each edge of every base triangle gives a fractional matching with capacities given by the exponent vector of and total weight . The assertion follows from Lemma 2.4.
Let be a monomial such that is an associated prime of . Since while , we have . Thus at least one variable of a base triangle does not divide .
Let be a base triangle and suppose that . Consider any of the triangles attached to . If neither nor divides , then the capacities of are all zero. Since and have no neighbors outside , adding either or cannot increase the fractional matching number. By Lemma 2.4, neither nor belongs to . Thus , contradicting . Therefore at least one of divides .
Let be the number of variables of the base triangles that do not divide . Each such missing variable forces at least one variable from each of its attached triangles to divide . These attached triangles have distinct vertices outside the base triangles. Consequently,
It follows that , and hence
as desired.
Theorem 4.5. For any fixed integer and any positive integer , there exists a graph such that
Proof. For ease of reading, we divide the proof into several steps.
Step 1: Graph Construction .
The Core Graph : The graph consists of a triangle with vertices , a -cycle with vertices , and an additional vertex adjacent to both and . Let denote the set of these core vertices.
The Attached Paths : For each vertex , we attach paths of length 2. That is, for each index , we introduce two new vertices, and , along with the edges and .
Step 2: The -number of the Integral Closure. By [14 Theorem 2.10], we have . It then follows that
Hence, . Moreover, as , we conclude that
Step 3: Lower Bound Setup via the Set . To establish a lower bound for , let be a monomial such that and is a prime ideal. We define the subset of core vertices
For any vertex and for each , at least one of or must divide . Indeed, if neither nor divides , then , while , leading to a contradiction since is a prime ideal.
Since each vertex in forces at least distinct variables from the attached paths to divide , while the remaining core vertices also divide , we obtain the degree bound
Hence, if , then , which yields
Step 4: The Case Where . Suppose . Then every core vertex divides , so the core monomial
divides . Observe that for all , as well as for with and . Thus, the remaining variables in can only come from and .
Moreover, for each , at least one of or must divide . Indeed, if neither divides , then while , a contradiction. Hence,
Combining both cases, we deduce that . Subtracting gives
By setting , we achieve the desired bound of . □
References
Department of Mathematics, University of Manitoba, 420 Machray Hall, 186 Dysart Road, Winnipeg, MB R3T 2N2 Canada
Email address: [email protected]
Tulane University, Mathematics Department, 6823 St. Charles Avenue, New Orleans, LA 70118, USA
Email address: [email protected]
Institute of Mathematics, VAST, 18 Hoang Quoc Viet, Hanoi, Vietnam
Email address: [email protected]
References
- [1]P. Biswas, M. Mandal, and P. Phukan, A comparison of the v-number of a monomial ideal and its integral closure, Preprint (2026), arXiv:2609.05044.arxiv.org/abs/2609.05044
- [3]A. Conca, A note on the v-invariant, Proc. Amer. Math. Soc. 152 (2024), 2349–2351.arxiv.org/abs/2401.00022
- [4]S. M. Cooper, A. Seceleanu, S. O. Tohaneanu, M. Vaz Pinto and R. H. Villarreal, Generalized minimum distance functions and algebraic invariants of Geramita ideals, Adv. in Appl. Math. 112 (2020), 101940.arxiv.org/abs/1812.06529
- [5]L. X. Dung, T. T. Hien, H. D. Nguyen, and T. N. Trung, Regularity and Koszul property of symbolic powers of monomial ideals, Math. Z. 298 (2021), 1487–1522.DOI
- [7]A. Ficarra and E. Sgroi, Asymptotic behaviour of the v-number of homogeneous ideals, J. Algebra 704 (2026), 273–297.DOI
- [8]A. Ficarra and E. Sgroi, Asymptotic behaviour of integer programming and the v-function of a graded filtration, J. J. Algebra Appl. (published online 2025), article 2650236, doi:10.1142/S0219498826502361.DOI
- [9]H. T. Hà and N. V. Trung, Membership Criteria and Containments of Powers of Monomial Ideals, Acta Math Vietnam 44 (2019), 117–139.DOI
- [10]D. Jaramillo and R. H. Villarreal, The v-number of edge ideals, J. Combin. Theory Ser. A 177 (2021), 105310.arxiv.org/abs/2001.06861
- [11]H. M. Lam and N. V. Trung, Associated primes of powers of edge ideals and ear decompositions of graphs, Trans. Amer. Math. Soc. 372 (2019), 3211–3236.DOI
- [12]J. Martínez-Bernal, S. Morey, and R. H. Villarreal, Associated primes of powers of edge ideals, Collect. Math. 63 (2012), 361–374.
- [13]D. H. Mau and T. N. Trung, Stability of associated primes and depth of integral closures of powers of edge ideals, Preprint (2021), arXiv:2108.01830.arxiv.org/abs/2108.01830
- [14]N. C. Minh and T. Vu, Integral closure of powers of edge ideals and their regularity, Journal of Algebra 609 (2022), 120–144.DOI
- [15]A. Simis, W. V. Vasconcelos, and R. H. Villarreal, On the ideal theory of graphs, J. Algebra 167 (1994), 389–416.DOI
- [16]T. N. Trung, Stability of associated primes of integral closures of monomial ideals, J. Combin. Theory Ser. A 116 (2009), 44–54.DOI
- [17]Vanmathi A and P. Sarkar, v-numbers of integral closure filtrations of monomial ideals, Preprint (2025), arXiv:2506.09051.arxiv.org/abs/2506.09051
