pith. sign in

arxiv: 1401.4817 · v1 · pith:7RVF3J6Gnew · submitted 2014-01-20 · 🧮 math.CO · math.AC

Binomial edge ideals with pure resolutions

classification 🧮 math.CO math.AC
keywords graphsidealsbinomialedgelinearpureresolutionssome
0
0 comments X
read the original abstract

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the binomial edge ideals for some classes of graphs. Also, we pose a conjecture on the linear strand of such ideals for every graph.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.