Graphs and complete intersection toric ideals

DOI10.1142/S0219498815400113MaRDI QIDQ2947374zbMATH OpenOpenAlexFDO

Authors Isabel Bermejo, Ignacio García Marco, Enrique Reyes

Publication date 22 September 2015

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

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

complete intersection graph homogeneous toric ideal

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of commutative algebra (05E40) Toric varieties, Newton polyhedra, Okounkov bodies (14M25)

Abstract: 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

P_{G}

is a complete intersection or not. Whenever

P_{G}

is a complete intersection, the algorithm also returns a minimal set of generators of

P_{G}

. Moreover, we prove that if

G

is a connected graph and

P_{G}

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.

Recommendations

Cites work

Cited in

(27)

This page was built for publication: Graphs and complete intersection toric ideals

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