Results 11 to 20 of about 38,270 (230)
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
Gorenstein binomial edge ideals [PDF]
Mathematische Nachrichten, 2021 AbstractWe classify connected graphs G whose binomial edge ideal is Gorenstein. In our proofs we use Frobenius type techniques and F‐pure thresholds.
openaire +3 more sources
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.
Ene V., Rinaldo G., Terai N.
openaire +3 more sources
Binomial Edge Ideals of Graphs [PDF]
The Electronic Journal of Combinatorics, 2012 We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms.
Kiani, Dariush, Saeedi, Sara
openaire +2 more sources
Binomial edge ideals of unicyclic graphs [PDF]
International Journal of Algebra and Computation, 2021 Let [Formula: see text] be a connected graph on the vertex set [Formula: see text]. Then [Formula: see text]. In this paper, we prove that if [Formula: see text] is a unicyclic graph, then the depth of [Formula: see text] is bounded below by [Formula: see text]. Also, we characterize [Formula: see text] with [Formula: see text] and [Formula: see text].
openaire +2 more sources
Parity binomial edge ideals [PDF]
Journal of Algebraic Combinatorics, 2015 21 pages, 3 figures, v2: minor problem in proof of Lemma 2.4 corrected, construction of Gr\"obner basis in Section 3 corrected, Example 5.1 replaced by Remark 5.1, final version as in Journal of Algebraic Combinatorics, v3: footnote to Lemma 3.8 ...
Kahle, Thomas +2 more
openaire +2 more sources
Regularity and h-polynomials of Binomial Edge Ideals [PDF]
Acta Mathematica Vietnamica, 2021 6 pages. Conjecture 0.1 has been deleted.
Hibi, Takayuki, Matsuda, Kazunori
openaire +3 more sources
Hilbert series of binomial edge ideals [PDF]
Communications in Algebra, 2019 13 pages, 2 images, typo error corrected, Accepted in Comm ...
Arvind Kumar, Rajib Sarkar
openaire +2 more sources
Binomial edge ideals of regularity 3 [PDF]
Journal of Algebra, 2018 Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Indeed, these characterizations are consequences of an explicit formula we obtain for the regularity of the ...
Saeedi Madani, Sara, Kiani, Dariush
openaire +2 more sources
Binomial Edge Ideals with Quadratic Gröbner Bases [PDF]
The Electronic Journal of Combinatorics, 2011 We prove that a binomial edge ideal of a graph $G$ has a quadratic Gröbner basis with respect to some term order if and only if the graph $G$ is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph $G$ that do not depend on the labelling of its vertex set.
CRUPI, Marilena, RINALDO, GIANCARLO
openaire +4 more sources