Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs

DOI10.1007/S10801-012-0421-XzbMATH Open1328.05202arXiv1212.6429OpenAlexW2148551046MaRDI QIDQ372841FDOQ372841

Authors: Isidoro Gitler, Enrique Reyes, Juan Antonio Vega 

Publication date: 21 October 2013

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{calO}$ associated to an orientation $calO$ of the edges of $G$, the toric ideal $P_{G_{calO}}$. In this paper we study those graphs with the property that $P_{G_{calO}}$ is a binomial complete intersection, for all $calO$. These graphs are called $extCIcalO$ 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 $extCIcalO$ 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 $heta-$partial wheels.

Full work available at URL: https://arxiv.org/abs/1212.6429

Recommendations

• Oriented graphs whose toric ideals are a complete intersection
• Ring graphs and complete intersection toric ideals
• Graphs and complete intersection toric ideals
• CIO and ring graphs: deficiency and testing
• On complete intersection toric ideals of graphs

zbMATH Keywords

complete intersectionsforbidden induced subgraphsoriented graphstoric ideals

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On rigid circuit graphs
• Graphs, rings and polyhedra
• Rees algebras of edge ideals
• Minimal generators of toric ideals of graphs
• Detecting induced subgraphs
• Ring graphs and toric ideals
• Ring graphs and complete intersection toric ideals
• Bipartite graphs whose edge algebras are complete intersections
• A generalization of chordal graphs
• Detecting a Theta or a Prism
• On the jacobian module associated to a graph
• Arithmetical rank of toric ideals associated to graphs
• On the universal Gröbner bases of toric ideals of graphs

Cited In (14)

• Well-covered and Cohen-Macaulay theta-ring graphs
• Implosive graphs: square-free monomials on symbolic Rees algebras
• Acyclic digraphs giving rise to complete intersections
• Matroid toric ideals: complete intersection, minors, and minimal systems of generators
• Theta-ring graphs, \(\mathrm{I}{{\mathcal{O}}} \)-compatibility and \(\Delta \)-matroids
• Graphs and complete intersection toric ideals
• On toric ideals arising from signed graphs
• Ring index of a graph
• On complete intersection toric ideals of graphs
• CIO and ring graphs: deficiency and testing
• Oriented graphs whose toric ideals are a complete intersection
• Ring graphs and complete intersection toric ideals
• Minimal generating sets of lattice ideals
• On the annihilator graph of a commutative ring

This page was built for publication: Complete intersection toric ideals of oriented graphs and chorded-theta subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q372841)