Ring graphs and toric ideals

Discrete Mathematics, 2010

We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideals are minimally generated by Gröbner bases. We prove that any graph can be oriented such that its toric ideal is a complete intersection with a universal Gröbner basis determined by the cycles. It turns out that bipartite ring graphs are exactly the bipartite graphs that have complete intersection toric ideals for any orientation. 0 2000 Mathematics Subject Classification. Primary 05C75; Secondary 05C85, 05C20, 13H10.

2010

Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the primitive, the minimal, the indispensable and the fundamental binomials of the toric ideal $I_G$.

Journal of Algebra and Its Applications, 2015

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph G, checks whether its toric ideal PG is a complete intersection or not. Whenever PG is a complete intersection, the algorithm also returns a minimal set of generators of PG. Moreover, we prove that if G is a connected graph and PG is a complete intersection, then there exist two induced subgraphs R and C of G such that the vertex set V(G) of G is the disjoint union of V(R) and V(C), where R is a bipartite ring graph and C is either the empty graph, an odd primitive cycle, or consists of two odd primitive cycles properly connected. Finally, if R is 2-connected and C is connected, we list the families of graphs whose toric ideals are complete intersection.

2005

Let G = (V, E) be a finite, simple graph. We consider for each oriented graph G O associated to an orientation O of the edges of G, the toric ideal P GO. In this paper we study those graphs with the property that P GO is a binomial complete intersection, for all O. These graphs are called CIO graphs. We prove that these graphs can be constructed recursively as clique-sums of cycles and/or complete graphs. We introduce the chorded-theta subgraphs and their transversal triangles. Also we establish that the CIO graphs are determined by the property that each chorded-theta has a transversal triangle. As a consequence, we obtain that the tournaments hold this property. Finally we explicitly give the minimal forbidden induced subgraphs that characterize these graphs, these families of graphs are: prisms, pyramids, thetas and a particular family of wheels that we call θ−partial wheels.

Journal of Commutative Algebra, 2009

A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the graph. We study the cut ideals of the family of ring graphs, which includes trees and cycles. We show that they have quadratic Gröbner bases and that their coordinate rings are Koszul, Hilbertian, and Cohen-Macaulay, but not Gorenstein in general.

Journal of Algebraic Combinatorics, 2013

Let G = (V, E) be a finite, simple graph. We consider for each oriented graph G O associated to an orientation O of the edges of G, the toric ideal P GO. In this paper we study those graphs with the property that P GO is a binomial complete intersection, for all O. These graphs are called CIO graphs. We prove that these graphs can be constructed recursively as clique-sums of cycles and/or complete graphs. We introduce the chorded-theta subgraphs and their transversal triangles. Also we establish that the CIO graphs are determined by the property that each chorded-theta has a transversal triangle. As a consequence, we obtain that the tournaments hold this property. Finally we explicitly give the minimal forbidden induced subgraphs that characterize these graphs, these families of graphs are: prisms, pyramids, thetas and a particular family of wheels that we call θ−partial wheels.

Transactions of the American Mathematical Society, 2008

Each partition λ = (λ1, λ2, . . . , λn) determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by quadrics. We show that such an ideal has a 2-linear minimal free resolution, i.e. it defines a small subscheme. In fact, we prove that this property characterizes Ferrers graphs among bipartite graphs. Furthermore, using a method of Bayer and Sturmfels, we provide an explicit description of the maps in its minimal free resolution: This is obtained by associating a suitable polyhedral cell complex to the ideal/graph. Along the way, we also determine the irredundant primary decomposition of any Ferrers ideal. We conclude our analysis by studying several features of toric rings of Ferrers graphs. In particular we recover/establish formulae for the Hilbert series, the Castelnuovo-Mumford regularity, and the multiplicity of these rings. While most of the previous works in this highly investigated area of research involve path counting arguments, we offer here a new and self-contained approach based on results from Gorenstein liaison theory.

ArXiv, 2019

We investigate the computational complexity of problems on toric ideals such as normal forms, Grobner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient algorithms by taking advantage of the sparsity pattern of the matrix. We describe this sparsity pattern with a graph, and study the parameterized complexity of toric ideals in terms of graph parameters such as treewidth and treedepth. In particular, we show that the normal form problem can be solved in parameter-tractable time in terms of the treedepth. An important application of this result is in multiway ideals arising in algebraic statistics. We also give a parameter-tractable membership test to the reduced Grobner basis. This test leads to an efficient procedure for computing the reduced Grobner basis. Similar results hold for Graver bases computation.

The rings considered in this article are commutative with identity which admit at least two maximal ideals. Let R be a ring such that R admits at least two maximal ideals. Recall from Ye and Wu (J. Algebra Appl. 11(6): 1250114, 2012) that the comaximal ideal graph of R, denoted by C (R) is an undirected simple graph whose vertex set is the set of all proper ideals I of R such that I ̸⊆ J(R), where J(R) is the Jacobson radical of R and distinct vertices I1, I2 are joined by an edge in C(R) if and only if I1 + I2 = R. In Section 2 of this article, we classify rings R such that C (R) is planar. In Section 3 of this article, we classify rings R such that C (R) is a split graph. In Section 4 of this article, we classify rings R such that C(R) is complemented and moreover, we determine the S-vertices of C (R).

2019

Let G be a simple graph. In this article we show that if G is connected and R(I(G)) is normal, then reg(R(I(G))) ≤ α0(G), where α0(G) the vertex cover number of G. As a consequence, every normal König connected graph G, reg(R(I(G))) = mat(G), the matching number of G. For a gap-free graph G, we give various combinatorial upper bounds for reg(R(I(G))). As a consequence we give various sufficient conditions for the equality of reg(R(I(G))) and mat(G). Finally we show that if G is a chordal graph such that K[G] has q-linear resolution (q ≥ 4), then K[G] is a hypersurface, which proves the conjecture of Hibi-Matsuda-Tsuchiya [12, Conjecture 0.2], affirmatively for chordal graphs.