pith. sign in

arxiv: 1807.07273 · v2 · pith:4F73QR4Nnew · submitted 2018-07-19 · 🧮 math.AC

Hilbert Series Of Binomial Edge Ideals

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

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in the polynomial ring $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we compute the Hilbert series of binomial edge ideal of decomposable graphs in terms of Hilbert series of its indecomposable subgraphs. Also, we compute the Hilbert series of binomial edge ideal of join of two graphs and as a consequence we obtain the Hilbert series of complete $k$-partite graph, fan graph, multi-fan graph and wheel 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.