Delio Jaramillo, Rafael H. Villarreal
The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic power Cohen-Macaulay.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We characterize unmixed and Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs. We also provide examples of oriented graphs which have unmixed and non-Cohen-Macaulay vertex-weighted edge ideals, while the edge ideal of their underlying graph is Cohen-Macaulay. This disproves a conjecture posed by Pitones, Reyes and Toledo.
We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph has the same depth as its initial ideal.
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
We classify the Cohen-Macaulay binomial edge ideals of cactus and bicyclic graphs.
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.
We determine the arithmetical rank of every edge ideal of a Ferrers graph.
Regularity of edge ideals of powers of graphs
本文研究图的幂的边理想的正则性，证明了森林的幂的边理想正则性弱递减，并计算了圈的幂的边理想正则性。
We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.
We study powers of binomial edge ideals associated with closed and block graphs.
(Generalized) binomial edge ideals and their regularity
本文综述二项式边理想及广义二项式边理想的Castelnuovo-Mumford正则性研究进展，并将已知上界推广至广义情形。
We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.
We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
We compute the Betti numbers for all the powers of initial and final lexsegment edge ideals. For the powers of the edge ideal of an anti-$d-$path, we prove that they have linear quotients and we characterize the normally torsion-free ideals. We determine a class of non-squarefree ideals, arising from some particular graphs, which are normally torsion-free.
Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in degree d. The edge ideal of a simple graph G on vertices x_1, ..., x_n is the quadratic square-free monomial ideal generated by all x_i x_j where {x_i,x_j} is an edge of G. The only edge ideals that are Gotzmann are those edge ideals corresponding to star graphs.
In this paper, we study the Hankel edge ideals of graphs. We determine the minimal prime ideals of the Hankel edge ideal of labeled Hamiltonian and semi-Hamiltonian graphs, and we investigate radicality, being a complete intersection, almost complete intersection and set theoretic complete intersection for such graphs. We also consider the Hankel edge ideal of trees with a natural labeling, called rooted labeling. We characterize such trees whose Hankel edge ideal is a complete intersection, and moreover, we determine those whose initial ideal with respect to the reverse lexicographic order sa…
Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that edge ideals of complete admissible uniform clutters are normally torsion free. The normality of a monomial ideal is expressed in terms of blocking polyhedra and the integer decomposition property. For edge ideals of clutters this property completely determine their normality
Complementary edge ideals
本文提出图的补边理想概念，并研究其代数性质与不变量。
Let $G$ be a cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.
We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper and lower bounds for the regularity of binomial edge ideals of a class of trees called lobsters. We also obtain precise expressions for the regularities of binomial edge ideals of certain classes of trees and block graphs.
Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gröbner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely weakly-closed graphs (or co-comparability graphs). Build on some results about Knutson ideals of generic matrices, we characterize weakly closed graphs as the only graphs whose binomial edge ideals are Knutson ideals for a certain polynomial $f$. In doing so, we re-prove Matsuda's theorem about the F-purity of binomial edge ideals of weakly closed graphs in posit…
On the symbolic $F$-splitness of binomial edge ideals
本文研究了二项边理想族的符号$F$-分裂性及其符号吹胀代数的强$F$-正则性，利用Fedder类准则和相关图的组合性质对上述情形进行了探讨。
In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and only if it is almost Cohen-Macaulay.
In this paper, we study associated primes and depth of integral closures of powers of edge ideals. We provide sharp bounds on how big of powers for which the set of associated primes and the depth of integral closures of powers of edge ideals are stable.
We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.
In this paper, we introduce some reduction processes on graphs which preserve the regularity of related edge ideals. As a consequence, an alternative proof for the theorem of R. Fröberg on linearity of resolution of edge ideal of graphs is given.
We consider the edge ideals of large classes of graphs with whiskers and for these ideals we prove that the arithmetical rank is equal to the big height. Then we extend these results to other classes of squarefree monomial ideals, generated in any degree, proving that the same equality holds.
Regularity of normal Rees algebras of edge ideals of graphs
本研究针对图的边理想的正规Rees代数，分类了所有满足代数正规且正则性与图的匹配数相等的图，完善了交换代数与图论交叉领域的相关结论。
We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose binomial edge ideals are Cohen-Macaulay and unmixed. So that we generalize the results of Ene, Herzog and Hibi on block graphs. Moreover, we study unmixedness and Cohen-Macaulayness of the binomial edge ideal of some graph products such as the join and corona of two graphs with respect to the original graphs'.
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the binomial edge ideals for some classes of graphs. Also, we pose a conjecture on the linear strand of such ideals for every graph.
Assume that $G$ is a graph with edge ideal $I(G)$. We provide sharp lower bounds for the depth of $I(G)^2$ in terms of the star packing number of $G$.
In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs whose complement does not have any induced four cycle.
Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions. Also we give a combinatorial description for the projective dimension of the edge ideals of unmixed bipartite graphs.
We give a new combinatorial characterization of the big height of a squarefree monomial ideal leading to a new bound for the projective dimension of a monomial ideal.
Koszul Binomial Edge Ideals
本文证明图定义Koszul双项边理想当且仅当图是强弦图且无爪图。
Regularity of powers of d-sequence (parity) binomial edge ideals of unicycle graphs
本文分类了单圈图中边缘二项式构成d-序列的图，并研究其（奇偶）二项式边缘理想的幂的正则度。
D-Sequence Edge Binomials, and Regularity of Powers of Binomial Edge Ideals of Trees
本文以图的度序列为依据，给出了树的边二项式构成 $d$-序列的充要条件，并研究了由 $d$-序列边二项式生成的树的二项式边理想幂的正则性。
Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the question of when such powers are linearly related or have linear resolution. We also consider the so-called squarefree Ratliff property.
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Indeed, these characterizations are consequences of an explicit formula we obtain for the regularity of the binomial edge ideal of the join product of two graphs. Finally, by using our regularity formula, we discuss some open problems in the literature. In particular we disprove a conjecture in \cite{CDI} on the regularity of weakly closed graphs.
In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$, we define the invariant $η(G)$ as the maximum size of a clique disjoint edge set in $G$. We show that the regularity of the binomial edge ideal of $G$ is bounded above by $η(G)$. This, in particular, settles a conjecture on the regularity of binomial edge ideals in full generality.
Homological invariants of edge ideals of weighted oriented graphs
该研究确定了固定顶点数加权有向图边理想的深度、维数和正则性三元组，并计算了固定顶点数加权有向树及二部图边理想的贝蒂表大小。
Given an edge ideal of graph G, we show that if the first nonlinear strand in the resolution of $I_G$ is zero until homological stage $a_1$, then the next nonlinear strand in the resolution is zero until homological stage $2a_1$. Additionally, we define a sequence, called a \emph{jump sequence}, characterizing the highest degrees of the free resolution of the edge ideal of G via the lower edge of the Betti diagrams of $I_G$. These sequences strongly characterize topological properties of the underlying Stanley-Reisner complexes of edge ideals, and provide general conditions on construction of …
We prove that, for the edge ideal of a graph whose cycles are pairwise vertex-disjoint, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes.
We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present a linear time algorithm to compute the Castelnuovo-Mumford regularity and Krull dimension of binomial edge ideals of block graphs.
We make some observations on binomial edge ideals, with the characterization of their Koszulness as motivation. Inspired by results of Ene, Herzog and Hibi, we discuss building Koszul graphs from smaller pieces in a controlled manner. We characterize the Koszul property of cone graphs and compute the dual algebra of the quadratic algebra coming from an arbitrary binomial edge ideal. We compute the first two syzygies of the infinite minimal free resolution of the residue field over the algebra defined by a binomial edge ideal, and observe that they are always linear.
Stabilization index of V-number of powers of edge ideals of graphs
本文针对任意图的边理想幂的v-函数，给出了其稳定化指数的组合刻画。
Let $G=W(C_{n})$ be a whiskered cycle graph with edge ideal $I=I(G)$. We prove that for every $s\geq 1$, the equality ${\rm reg}(I^{s})=2s+\lceil \frac{n-1}{2}\rceil-1$ holds.
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gröbner basis and characterize unmixedness and Cohen--Macaulayness.
Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).
We consider a class of graphs $G$ such that the height of the edge ideal $I(G)$ is half of the number $\sharp V(G)$ of the vertices. We give Cohen-Macaulay criteria for such graphs.
On the Depth of Generalized Binomial Edge Ideals
本文通过推广d-兼容映射并利用顶点连通性，给出了广义二项式边理想深度的组合下界与上界，并证明两界差异可任意大，同时计算了循环图等若干图类的深度。
We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\mathrm{reg}(J_G)\leq n-1$ for any graph $G$ with $n$ vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs.
Bounded powers of edge ideals: symmetric exchange binomials
本文研究离散多拟阵基环的toric理想生成问题，证明了几类离散多拟阵（特别是源于有限图边理想有界幂的）的toric理想可由对称交换二项式生成。
We graph-theoretically characterize the class of graphs $G$ such that $I(G)^2$ are Buchsbaum.
A Characterization of Edge Ideals with $reg(R/I(G)) = 3$
本文研究了使R/I(G)正则度为3的图G的特征，通过分析边理想结构确定了相关条件。
We study the Koszul property of a standard graded $K$-algebra $R$ defined by the binomial edge ideal of a pair of graphs $(G_1,G_2)$. We show that the following statements are equivalent: (i) $R$ is Koszul; (ii) the defining ideal $J_{G_1,G_2}$ of $R$ has a quadratic Gröbner basis; (iii) the graded maximal ideal of $R$ has linear quotients with respect to a suitable order of its generators
Binomial edge ideals of crown graphs
本文研究冠图和圈的二项式边理想，刻画投射维数等于大高度的图类，并证明关于圈的Vasconcelos数的一个猜想。
Let $G$ be a unicyclic graph with edge ideal $I(G)$. For any integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$. It is shown that ${\rm reg}(I(G)^{(s)})={\rm reg}(I(G)^s)$, for every $s\geq 1$.
Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subseteq J$. In this paper, we obtain a general upper and lower bound for the Castelnuovo-Mumford regularity of $IJ$ in terms of certain invariants associated with $I$ and $J$. Using these results, we explicitly compute the regularity of $IJ$ for several classes of edge ideals. Let $J_1,\ldots,J_d$ be edge ideals in a polynomial ring $R$ with $J_1 \subseteq \cdots \subseteq J_d$. Finally, we compute the precise expression for the regularity of $J_1 J_2\cdots J_d$ when $d \in \{3,4\}$ and $J_d$ is the …
The Cohen-Macaulay type of edge-weighted r-path ideals
本文对任意正整数r，用组合方法刻画了边加权r-路径悬挂的Cohen-Macaulay型，并将边加权悬挂情形统一为r=1的特例。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。