Kyouko Kimura
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Let $\operatorname{pd}(I(G))$ and $\operatorname{reg}(I(G))$ respectively denote the projective dimension and the regularity of the edge ideal $I(G)$ of a graph $G$. For any positive integer $n$, we determine all pairs $(\operatorname{pd}(I(G)),\, \operatorname{reg}(I(G)))$ as $G$ ranges over all connected bipartite graphs on $n$ vertices.
We prove a conjectured lower bound of Nagel and Reiner on Betti numbers of edge ideals of bipartite graphs.
We study the dependence of graded Betti numbers of monomial ideals on the characteristic of the base field. The examples we describe include bipartite ideals, Stanley--Reisner ideals of vertex-decomposable complexes and ideals with componentwise linear resolutions. We give a description of bipartite graphs and, using discrete Morse theory, provide a way of looking at the homology of arbitrary simplicial complexes through bipartite ideals. We also prove that the Betti table of a monomial ideal over the field of rational numbers can be obtained from the Betti table over any field by a sequence o…
Betti splittings and multigraded Betti numbers of cover ideals of bipartite graphs
该研究探讨二部图覆盖理想的Betti分裂，证明二部图覆盖理想的任意$x_i$-划分为Betti分裂，且任意无平方项单项式理想的多重分次Betti数可出现在某二部图覆盖理想的对应分次Betti数特定部分中。
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.
Let $G$ be a simple graph on $n$ vertices. Let $H$ be either the complete graph $K_m$ or the complete bipartite graph $K_{r,s}$ on a subset of the vertices in $G$. We show that $G$ contains $H$ as a subgraph if and only if $β_{i,α}(H) \le β_{i,α}(G)$ for all $i \ge 0$ and $α\in \mathbb{Z}^n$. In fact, it suffices to consider only the first syzygy module. In particular, we prove that $β_{1,α}(H) \le β_{1,α}(G)$ for all $α\in \mathbb{Z}^n$ if and only if $G$ contains a subgraph that is isomorphic to either $H$ or a multipartite graph $K_{2,\dots,2,a,b}$.
Betti numbers of normal edge rings (\bf{I})
本文提出诱导子图方法，计算双耳图、紧图对应的正规边环的多重分次Betti数，揭示不同类型图的Betti数特性，预期该方法可推广至其他正规边环。
For an unmixed bipartite graph $G$ we consider the lattice of vertex covers $\mathcal{L}_G$ and compute depth, projective dimension and extremal Betti-numbers of $R/I(G)$ in terms of this lattice.
We provide the regularity and the Cohen-Macaulay type of binomial edge ideals of Cohen-Macaulay cones, and we show the extremal Betti numbers of some classes of Cohen-Macaulay binomial edge ideals: Cohen-Macaulay bipartite and fan graphs. In addition, we compute the Hilbert-Poincaré series of the binomial edge ideals of some Cohen-Macaulay bipartite graphs.
We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal graded free resolution where there exists a minimal generator of degree $>i+3$, show that at this step the highest degree of a minimal generator is $i+4$, and determine the value of the corresponding graded Betti number $β_{i,i+4}$ in terms of the combinatorics of the associated bipartite graph. The results can then be easily extended to the non-squarefree case t…
Generalized Andrásfai graphs and special Betti diagrams of edge ideals
研究广义安德拉斯法伊图的边理想特性，发现其贝蒂图具有特殊形状，扩展了完整图和完整双图的正则度和射影维数结果。
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain upper bounds for the Betti numbers of this type of ideals. These take the form of simple formulas on the number of vertices, which arise from the enumeration of induced subgraphs of certain incomparability graphs associated to the edge sets of trees.
We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs depending on induced subgraphs.
A natural extension of bipartite graphs are $d$-partite clutters, where $d \geq 2$ is an integer. For a poset $P$, Ene, Herzog and Mohammadi introduced the $d$-partite clutter $\mathcal{C}_{P,d}$ of multichains of length $d$ in $P$, showing that it is Cohen-Macaulay. We prove that the cover ideal of $\mathcal{C}_{P,d}$ admits an $x_i$-splitting, determining a recursive formula for its Betti numbers and generalizing a result of Francisco, Hà and Van Tuyl on the cover ideal of Cohen-Macaulay bipartite graphs. Moreover we prove a Betti splitting result for the Alexander dual of a Cohen-Macaulay s…
We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a corollary, we compute the Hilbert series and $h$-vector for all the toric ideals of graphs in this family.
In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in terms of associated combinatorial data and show that the lower bound is attained in some cases. Also, we obtain bounds on the projective dimension of edge ideals of these graphs in terms of combinatorial data.
Betti numbers of normal edge rings (II)
本文利用诱导子图方法计算多路径图边环的Betti数，并证明其所有多重分次Betti数均可由某些诱导子图的最高多重分次Betti数给出。
Betti Numbers of Edge Ideals of Weighted Oriented Crown Graphs
本文通过诱导子图方法计算加权有向冠图边理想的多分次Betti数，并证明其总Betti数与权函数无关。
We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are investigated if the graph can be decomposed as $0$-clique sums and disjoint union of subgraphs. The total Betti numbers of a cycle are computed. Moreover, we classify all Freiman ideals among monomial cut ideals.
Critical subgraphs and the regularity of symbolic powers of cover ideals of graphs
本文通过t-可接受子图确定图的覆盖理想t次符号幂的正则性，并应用于双部单环图的覆盖理想幂的正则性计算。
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bipartite graphs. Finally, we consider the frequency with which one can find particular splittings of monomial ideals and raise questions about ideals whose resolutions are characteristic-dependent.
A certain squarefree monomial ideal $H_P$ arising from a finite partially ordered set $P$ will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of $H_P$ possesses a quadratic Gröbner basis. Thus in particular all powers of $H_P$ have linear resolutions. Second, the minimal free graded resolution of $H_P$ will be constructed explicitly and a combinatorial formula to compute the Betti numbers of $H_P$ will be presented. Third, by using the fact that the Alexander dual of the simplicial complex $Δ$ whose Stan…
Let $G$ be an unmixed bipartite graph of dimension $d-1$. Assume that $K_{n,n}$, with $n\ge 2$, is a maximal complete bipartite subgraph of $G$ of minimum dimension. Then $G$ is Cohen-Macaulay in codimension $d-n+1$. This generalizes a characterization of Cohen-Macaulay bipartite graphs by Herzog and Hibi and a result of Cook and Nagel on unmixed Buchsbaum graphs. Furthermore, we show that any unmixed bipartite graph $G$ which is Cohen-Macaulay in codimension $t$, is obtained from a Cohen-Macaulay graph by replacing certain edges of $G$ with complete bipartite graphs. We provide some examples.
Linear strands of powers of certain binomial edge ideals
本文研究了特定二项式边理想幂的线性链的贝蒂数公式，并验证了Ene-Rinaldo-Terai的猜想。
Algebraic and geometric aspects of bipartite planar graphs
本文研究具有偶数个区域的二部平面图，给出其关联商环的分次 Betti 数与投射维数的界，并探讨最小顶点覆盖和最大匹配。
On the Betti numbers and gracefulness of some planar graphs
本文研究二部平面图 St_r 的代数与标号性质，建立了区域数 r 与边理想投射分解中分次 Betti 数、投射维数等代数不变量的关系，并证明该类图具有边优美标号。
A very well-covered graph is an unmixed graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. We study these graphs by means of Betti splittings and mapping cone constructions. We show that the cover ideals of Cohen-Macaulay very well-covered graphs are splittable. As a consequence, we compute explicitly the minimal graded free resolution of the cover ideals of such a class of graphs and prove that these graphs have homological linear quotients. Finally, we conjecture the same is true for each power of the cover ideal of a Cohen-Macaulay very…
We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on the calculation of projective dimension of (hyper)graphs. When G is just a (simple) graph, we prove that there exists an induced subgraph H of G such that prod-dim(G)=reg(S(H)), where S(H) is the subdivision graph of H. Moreover, we show that known upper bounds on prod-dim(G) involving domination parameters are in fact upper bounds to reg(S(G)).
A Complete Classification of 2-Linear Neighborhood Complexes
本文刻画了图G的Stanley-Reisner环k[N(G)]何时具有2-线性分解，等价于G是邻域共形且其公共邻域图是弦图，即G是仅含4-圈作为诱导圈的二分图，并由此得到Katzman下界等号成立条件及Cohen-Macaulay支配复形的分类。
Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal bipartite graph, we find an upper bound for the regularity of $I_G$ in terms of the size of the bipartition of $G$. We also give a new proof for the graded Betti numbers of the toric ideal associated to the complete bipartite graph $K_{2,n}$.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。