Algebraic properties of the binomial edge ideal of a complete bipartite graph
Let JG denote the binomial edge ideal of a connected undirected graph on n vertices. This is the ideal generated by the binomials xiyj − xjyi, 1 ≤ i < j≤ n, in the polynomial ring S = K[x1, . . . , xn, y1, . . . , yn] where {i, j} is an edge of G. We study the arithmetic properties of S/JG for G, th...
Wedi'i Gadw mewn:
| Prif Awduron: | , |
|---|---|
| Fformat: | Artigo |
| Iaith: | Inglês |
| Cyhoeddwyd: |
Sciendo
2014-06-01
|
| Cyfres: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
| Pynciau: | |
| Mynediad Ar-lein: | https://doi.org/10.2478/auom-2014-0043 |
| Tagiau: |
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|