Sequentially Cohen–Macaulay bipartite graphs: vertex decomposability and regularity

A Van Tuyl - Archiv der Mathematik, 2009 - Springer
Let G be a bipartite graph with edge ideal I (G) whose quotient ring R/I (G) is sequentially
Cohen–Macaulay. We prove:(1) the independence complex of G must be vertex …

Edge ideals of oriented graphs

HT Hà, KN Lin, S Morey, E Reyes… - International Journal of …, 2019 - World Scientific
Let 𝒟 be a weighted oriented graph and let I (𝒟) be its edge ideal. Under a natural condition
that the underlying (undirected) graph of 𝒟 contains a perfect matching consisting of leaves …

Cohen-Macaulay edge ideal whose height is half of the number of vertices

M Crupi, G Rinaldo, N Terai - Nagoya Mathematical Journal, 2011 - cambridge.org
Cohen-Macaulay edge ideal whose height is half of the number of vertices Page 1 Nagoya
Math. J. 201 (2011), 117–131 DOI 10.1215/00277630-2010-018 COHEN-MACAULAY EDGE …

Algebraic properties of edge ideals of corona product of certain graphs

B Shaukat, M Ishaq, AU Haq, Z Iqbal - arXiv preprint arXiv:2211.05721, 2022 - arxiv.org
We study the algebraic invariants namely depth, Stanley depth, regularity and projective
dimension of the residue class rings of the edge ideals associated with the corona product of …

Algebraic properties of edge ideals via combinatorial topology

A Dochtermann, A Engstrom - arXiv preprint arXiv:0810.4120, 2008 - arxiv.org
We apply some basic notions from combinatorial topology to establish various algebraic
properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we …

Cohen–Macaulay binomial edge ideals and accessible graphs

D Bolognini, A Macchia, F Strazzanti - Journal of Algebraic Combinatorics, 2022 - Springer
The cut sets of a graph are special sets of vertices whose removal disconnects the graph.
They are fundamental in the study of binomial edge ideals, since they encode their minimal …

The sequentially Cohen–Macaulay property of edge ideals of edge-weighted graphs

LTK Diem, NC Minh, T Vu - Journal of Algebraic Combinatorics, 2024 - Springer
Let I ( G , w ) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}
\usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} …

[HTML][HTML] Powers of ideals associated to (C4, 2K2)-free graphs

N Erey - Journal of Pure and Applied Algebra, 2019 - Elsevier
Let G be a (C 4, 2 K 2)-free graph with edge ideal I (G)⊂ k [x 1,…, xn]. We show that I (G) s
has linear resolution for every s≥ 2. Also, we show that every power of the vertex cover …

Powers of the vertex cover ideals

F Mohammadi - Collectanea mathematica, 2014 - Springer
We describe a combinatorial condition on a graph which guarantees that all powers of its
vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner's …

[PDF][PDF] Projective dimension and regularity of 3-path ideals of unicyclic graphs

NT Hang, T Vu - arXiv preprint arXiv:2402.16166, 2024 - arxiv.org
arXiv:2402.16166v1 [math.AC] 25 Feb 2024 Page 1 arXiv:2402.16166v1 [math.AC] 25 Feb 2024
PROJECTIVE DIMENSION AND REGULARITY OF 3-PATH IDEALS OF UNICYCLIC GRAPHS …