Results 1 to 10 of about 27,934 (169)
Licci binomial edge ideals [PDF]
Journal of Combinatorial Theory, Series A, 2020 We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
Viviana Ene +2 more
exaly +7 more sources
Forum of Mathematics, SigmaThe study of Koszul binomial edge ideals was initiated by V. Ene, J. Herzog, and T. Hibi in 2014, who found necessary conditions for Koszulness. The binomial edge ideal $J_G$ associated to a finite simple graph G is always generated by quadrics ...
Adam LaClair +3 more
doaj +3 more sources
Cohen-Macaulay binomial edge ideals [PDF]
Nagoya Mathematical Journal, 2011 We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.Comment: 9 ...
Ene, Viviana +2 more
core +5 more sources
Smoothness in Binomial Edge Ideals [PDF]
Mathematics, 2016 In this paper we study some geometric properties of the algebraic set associated to the binomial edge ideal of a graph. We study the singularity and smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algebraic
Hamid Damadi, Farhad Rahmati
doaj +3 more sources
Koszul binomial edge ideals [PDF]
, 2013 It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free.
A. Conca +16 more
core +2 more sources
Graph connectivity and binomial edge ideals [PDF]
Proceedings of the American Mathematical Society, 2016 We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is exactly $\frac{1}{2}$.
Arindam Banerjee +1 more
openalex +4 more sources
Regularity of powers of binomial edge ideals of complete multipartite graphs [PDF]
Czechoslovak Mathematical Journal, 2023 Let $$G = {K_{{n_1},{n_2}, \ldots ,{n_r}}}$$ G = K n 1 , n 2 , … , n r be a complete multipartite graph on [ n ] with n > r > 1 and J _ G being its binomial edge ideal.
Hong Wang, Zhongming Tang
openalex +2 more sources
Binomial edge ideals of Clutters [PDF]
, 2021 In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite{raufrin}. We also answer a question posed in their paper.
Kamalesh Saha, Indranath Sengupta
openalex +3 more sources
Regularity of parity binomial edge ideals [PDF]
Proceedings of the American Mathematical Society, 2020 10 pages, Suggestions and comments are welcome.
Arvind Kumar
openalex +5 more sources
On the Depth of Generalized Binomial Edge Ideals [PDF]
Mediterranean Journal of MathematicsThis research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of d-compatible map and use it to give a combinatorial lower bound for the depth of generalized binomial edge ideals.
J. Anuvinda +2 more
openalex +2 more sources