Hilbert Series Of Binomial Edge Ideals

Abstract

Let G be a finite simple graph on n vertices and JG denote the corresponding binomial edge ideal in the polynomial ring S = K[x1, …, xn, y1, …, yn]. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…