Graph connectivity and binomial edge ideals

DOI10.1090/proc/13241zbMath1356.13008arXiv1605.00314OpenAlexW2963378568MaRDI QIDQ5298175

Arindam Banerjee, Luis Núñez-Betancourt

Publication date: 14 December 2016

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00314

zbMATH Keywords

Cohen-Macaulay ringsvertex connectivitybinomial edge idealsgraph toughness

Mathematics Subject Classification ID

Cohen-Macaulay modules (13C14) Connectivity (05C40) Combinatorial aspects of commutative algebra (05E40)

Related Items (20)

On the depth of binomial edge ideals of graphs ⋮ Cohen-Macaulay binomial edge ideals and accessible graphs ⋮ Local cohomology of binomial edge ideals and their generic initial ideals ⋮ Arithmetical rank of binomial ideals ⋮ Diameter and connectivity of finite simple graphs ⋮ Gorenstein binomial edge ideals ⋮ Level and pseudo-Gorenstein binomial edge ideals ⋮ Frobenius methods in combinatorics ⋮ On the extremal Betti numbers of the binomial edge ideal of closed graphs ⋮ \((S_2)\)-condition and Cohen-Macaulay binomial edge ideals ⋮ Local cohomology and Lyubeznik numbers of \(F\)-pure rings ⋮ Cohen–Macaulay binomial edge ideals of cactus graphs ⋮ Binomial edge ideals of generalized block graphs ⋮ Binomial edge ideals of small depth ⋮ A proof for a conjecture on the regularity of binomial edge ideals ⋮ Binomial edge ideals of bipartite graphs ⋮ Binomial edge ideals of regularity 3 ⋮ Binomial edge ideals and bounds for their regularity ⋮ Hilbert series of binomial edge ideals ⋮ Binomial edge ideals of unicyclic graphs

Uses Software

• Macaulay2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regularity bounds for binomial edge ideals
• On the Betti numbers of some classes of binomial edge ideals
• Dimension projective finie et cohomologie locale. Applications à la demonstration de conjectures de M. Auslander, H. Bass et A. Grothendieck
• Binomial edge ideals and conditional independence statements
• Multiplicity and Hilbert-Kunz multiplicity of monoid rings.
• The Hilbert-Kunz function
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Distributive lattices, bipartite graphs and Alexander duality
• Algebraic properties of the binomial edge ideal of complete bipartite graph
• Graphs and Ideals Generated by Some 2-Minors
• Cohen-Macaulay binomial edge ideals
• Notes on Hilbert-Kunz Multiplicity of Rees Algebras
• Cohen-Macaulay binomial edge ideals of small deviation

This page was built for publication: Graph connectivity and binomial edge ideals