Related papers: Almost Cohen-Macaulay bipartite graphs and connect…

In this paper we show a correspondence between directed graphs and bipartite undirected graphs with a perfect matching, that allows to study properties of directed graphs through the properties of the corresponding undirected graphs. In…

We classify Cohen-Macaulay graphs of girth at least $5$ and planar Gorenstein graphs of girth at least $4$. Moreover, such graphs are also vertex decomposable.

We classify all Cohen-Macaulay chordal graphs. In particular. it is shown that a chordal graph is Cohen-Macaulay if and only if its unmixed.

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide…

Let $H$ be a simple undirected graph. The family of all matchings of $H$ forms a simplicial complex called the matching complex of $H$. Here , we give a classification of all graphs with a Gorenstein matching complex. Also we study when the…

In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…

We characterize Cohen-Macaulay posets of dimension two; they are precisely the shellable and strongly connected posets of dimension two. We also give a combinatorial description of these posets. Using the fact that co-comparability graph of…

The aim of the present exposition is to investigate varieties of almost minimal degree and of low codimension, in particular their Betti diagrams. Here minimal degree is defined as $\deg X = \codim X + 2.$ We describe the structure of the…

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected…

Let $G$ be a graph and $k$ be a positive integer, and let $Kc(G, k)$ denote the number of Kempe equivalence classes for the $k$-colorings of $G$. In 2006, Mohar noted that $Kc(G, k) = 1$ if $G$ is bipartite. As a generalization, we show…

Let $R$ be a standard graded polynomial ring over a field $k$. The paper focuses on homogeneous ideals $J \subset R$ of codimension $2$ generated by three forms of the same degree $d \geq 2$ that are almost Cohen--Macaulay, i.e., of…

The Cohen-Macaulay property of a graph arising from a poset has been studied by various authors. In this article, we study the Cohen-Macaulay property of a graph arising from a family of reflexive and antisymmetric relations on a set. We…

We extend some results on almost Gorenstein affine monomial curves to the nearly Gorenstein case. In particular, we prove that the Cohen-Macaulay type of a nearly Gorenstein monomial curve in $\mathbb{A}^4$ is at most $3$, answering a…

In this paper, for the development of the study of almost Gorenstein graded rings, we discuss some relations between almost Gorensteinness of Cohen--Macaulay homogeneous rings and their $h$-vectors. Concretely, for a Cohen--Macaulay…

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…

Minimal prime graphs are connected graphs on at least two vertices whose complements satisfy the following conditions: triangle-freeness, 3-colorability, and edge-maximality with respect to the latter two properties. These graphs are prime…

We introduce a construction on a flag complex that, by means of modifying the associated graph, generates a new flag complex whose $h$-factor is the face vector of the original complex. This construction yields a vertex-decomposable, hence…

A graph $X$ is said to be chordal bipartite if it is bipartite and contains no induced cycle of length at least $6$. It is proved that if $X$ does not contain bipartite claw as an induced subgraph, then the Weisfeiler-Leman dimension of $X$…

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…