Abstract
Let be a finite connected simple graph and the toric ideal of the edge ring of . In the present paper, we study finite graphs with the property that is generated by quadratic binomials and possesses no quadratic Gröbner basis. First, we give a nontrivial infinite series of finite graphs with the above property. Second, we implement a combinatorial characterization for to be generated by quadratic binomials and, by means of the computer search, we classify the finite graphs with the above property, up to 8 vertices.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.