Graph Connectivity and Binomial Edge Ideals
Abstract
We relate homological properties of a binomial edge ideal JG to invariants that measure the connectivity of a simple graph G. Specifically, we show if R/JG is a Cohen-Macaulay ring, then graph toughness of G is exactly 12. We also give an inequality between the depth of R/JG and the vertex-connectivity of G. In addition, we study the Hilbert-Samuel multiplicity, and the Hilbert-Kunz multiplicity of R/JG.
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.