arXiv · 0812.3097
Arithmetical rank of toric ideals associated to graphs
Abstract
Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is generated by quadratic binomials. In both cases we prove that the binomial arithmetical rank and the $G$-arithmetical rank coincide with the minimal number of generators of $I_G$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anargyros Katsabekis. 2009-12-16. Arithmetical rank of toric ideals associated to graphs. https://arxiv.org/abs/0812.3097
Cite the original work for its findings. Save a collection to share your selection of sources.