Closed Cohen-Macaulay completion of binomial edge ideals

arXiv2104.14143MaRDI QIDQ6366408FDOQ6366408

Kamalesh Saha, Indranath Sengupta

Publication date: 29 April 2021

Abstract: Let $mathbfCCM$ denote the class of closed graphs with Cohen-Macaulay binomial edge ideals and $mathbfPIG$ denote the class of proper interval graphs. Then $mathbfCCMsubseteqmathbfPIG$. The $mathbfPIG$-completion problem is a classical problem in molecular biology as well as in graph theory and this problem is known to be NP-hard. In this paper, we study the $mathbfCCM$-completion problem. We give a method to construct all possible $mathbfCCM$-completion of a graph. We find the $mathbfCCM$-completion number and the set of all minimal $mathbfCCM$-completions for a large class of graphs. Moreover, for that class, we give a polynomial-time algorithm to compute the $mathbfCCM$-completion number and a minimum $mathbfCCM$-completion of a given graph. We investigate unmixed and Cohen-Macaulay properties of binomial edge ideals of induced subgraphs. Also, we discuss the accessible graphs completion and the Cohen-Macaulay property of binomial edge ideals of whisker graphs.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of commutative algebra (05E40) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10) Commutative rings defined by binomial ideals, toric rings, etc. (13F65)

This page was built for publication: Closed Cohen-Macaulay completion of binomial edge ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366408)