arXiv · 2212.09181
Cohen-Macaulay binomial edge ideals of small graphs
Abstract
A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its underlying graph $G$, called \textit{cut sets}. More precisely, the conjecture states that $J_G$ is Cohen-Macaulay if and only if $J_G$ is unmixed and the collection of the cut sets of $G$ is an accessible set system. In this paper we prove the conjecture theoretically for all graphs with up to $12$ vertices and develop an algorithm that allows to computationally check the conjecture for all graphs with up to $15$ vertices and all blocks with whiskers where the block has at most $11$ vertices. This significantly extends previous computational results.
Explore related subjects
Keep this discovery
Davide Bolognini, Antonio Macchia, Giancarlo Rinaldo, Francesco Strazzanti. 2022-12-18. Cohen-Macaulay binomial edge ideals of small graphs. https://arxiv.org/abs/2212.09181
Cite the original work for its findings. Save a collection to share your selection of sources.