English

Lov\'asz-Saks-Schrijver ideals and parity binomial edge ideals of graphs

Commutative Algebra 2021-12-07 v3

Abstract

Let GG be a simple graph on nn vertices. Let LG and IGL_G \text{ and } \mathcal{I}_G \: denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of GG in the polynomial ring S=K[x1,,xn,y1,,yn]S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n] respectively. We classify graphs whose LSS ideals and parity binomial edge ideals are complete intersections. We also classify graphs whose LSS ideals and parity binomial edge ideals are almost complete intersections, and we prove that their Rees algebra is Cohen-Macaulay. We compute the second graded Betti number and obtain a minimal presentation of LSS ideals of trees and odd unicyclic graphs. We also obtain an explicit description of the defining ideal of the symmetric algebra of LSS ideals of trees and odd unicyclic graphs.

Keywords

Cite

@article{arxiv.1911.10388,
  title  = {Lov\'asz-Saks-Schrijver ideals and parity binomial edge ideals of graphs},
  author = {Arvind Kumar},
  journal= {arXiv preprint arXiv:1911.10388},
  year   = {2021}
}

Comments

22 pages, Accepted for publication in European J. Combin