相关论文: Sequentially Cohen-Macaulay Edge Ideals

We study the Cohen-Macaulay property of triangular graphs $T_n$. We show that $T_2$, $T_3$ and $T_5$ are Cohen-Macaulay graphs, and that $T_4$, $T_6$, $T_8$ and $T_n$ are not Cohen-Macaulay graphs, for $n\geq 10$. Finally, we prove that…

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Alavi, Erd\H{o}s, Malde and Schwenk made the conjecture that if $G$ is a tree then the independent set sequence $\{i_t(G)\}_{t\geq 0}$ of $G$ is unimodal; Levit and…

In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…

This paper studies the zero-divisor graphs attached to several finite chain-ring families and computes the homological invariants of their edge ideals by using cochordal constructible systems. We begin with a general layered graph $C(q,L)$,…

The associated primes of an arbitrary lexsegment ideal $I\subset S=K[x_1,...,x_n]$ are determined. As application it is shown that $S/I$ is a pretty clean module, therefore, $S/I$ is sequentially Cohen-Macaulay and satisfies Stanley's…

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…

We introduce and investigate the open neighborhood ideal $\mathcal{N}(G)$ of a finite simple graph $G$. We describe the minimal primary decomposition of $\mathcal{N}(G)$ in terms of the minimal total dominating sets (TDSs) of $G$. Then we…

A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric…

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

For positive integers $d<n$, let $[n]_d=\{A\in 2^{[n]}\mid |A|=d\}$ where $[n]=:\{1,2,\ldots, n\}$. For a pure $f$-simplicial complex $\Delta$ such that ${\rm dim}(\Delta)={\rm dim}(\Delta^c)$ and $\mathcal{F}(\Delta)\cap…

Previously, Ohsugi and Hibi gave a combinatorial description of bipartite graphs $G$ whose toric edge ideal $I_G$ is generated by quadrics, showing that every cycle of $G$ of length at least $6$ must have a chord. This corresponds to the…

In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we…

Let $I(G)^{[k]}$ denote the $k^{th}$ square-free power of the edge ideal $I(G)$ of a graph $G$. In this article, we provide a precise formula for the depth of $I(G)^{[k]}$ when $G$ is a Cohen-Macaulay forest. Using this, we show that for a…

We show that every edge in a 2-edge-connected planar cubic graph is either contained in a 2-edge-cut or is a chord of some cycle that is contained in a 2-factor of the graph. As a consequence, we show that every edge in a cyclically…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

Let $G$ be a finite simple graph, and $J_G$ denote the binomial edge ideal of $G$. In this article, we first compute the $\mathrm{v}$-number of binomial edge ideals corresponding to Cohen-Macaulay closed graphs. As a consequence, we obtain…

Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…

In this survey paper we first present the main properties of sequentially Cohen-Macaulay modules. Some basic examples are provided to help the reader with quickly getting acquainted with this topic. We then discuss two generalizations of…