Related papers: Sequentially $S_r$ simplicial complexes and sequen…

We study the homological properties of $\Delta_{\mathbf{r}}(n_1, \dots, n_e)$, a simplicial complex formed by sequentially gluing complete graphs along $(r_i-1)$-simplices. This construction generates precisely the chordal clique complexes,…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…

Let G be a simple (i.e., no loops and no multiple edges) graph. We investigate the question of how to modify G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on modifications given by adding configurations of…

Let $K$ be a field and $S=K[x_1,\ldots,x_m, y_1,\ldots,y_n]$ be the standard bigraded polynomial ring over $K$. In this paper, we explicitly describe the structure of finitely generated bigraded "sequentially Cohen--Macaulay" $S$-modules…

We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a…

We study combinatorial and algebraic properties of $t$-clique-free complexes, a family of simplicial complexes associated with finite simple graphs that generalize the classical independence complex. For a graph $G$ and an integer $t \ge…

Let $K$ be a field, $S=K[x_1,\ldots,x_m, y_1,\ldots,y_n]$ be a standard bigraded polynomial ring and $M$ a finitely generated bigraded $S$-module. In this paper we study sequentially Cohen--Macaulayness of $M$ with respect to…

We introduce a class of chordal graphs called ($d_1$,$d_2$,$\dots$,$d_q$)-trees. A graph belongs to this class if and only if its clique complex is sequentially Cohen-Macaulay, providing a complete classification of all sequentially…

Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies…

Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…

Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

Let $G=(V,E)$ be a graph. If $G$ is a K\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\Delta_{G}$ is pure shellable, $R/I_{\Delta}$ is Cohen-Macaulay, $G$ is unmixed…

Graphs are ubiquitous to model the irregular (non-Euclidean) structure of complex data, but they are limited to pairwise relationships and fail to model the complexities of the datasets exhibiting higher-order interactions. In that context,…

Let G be a simple undirected graph. We find the number of maximal independent sets in complete t-partite graphs. We will show that vertex decomposability and shellability are equivalent in this graphs. Also, we obtain an equivalent…

Via the BGG-correspondence a simplicial complex D on [n] is transformed into a complex of coherent sheaves L(D) on the projective space n-1-space. In general we compute the support of each of its cohomology sheaves. When the Alexander dual…

In this paper we study the Alexander dual of a vertex decomposable simplicial complex. We define the concept of a vertex splittable ideal and show that a simplicial complex $\Delta$ is vertex decomposable if and only if $I_{\Delta^{\vee}}$…

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…

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 primary decomposition. We introduce the class of accessible…

In this note, we study Serre's property $(S_i)$, and its relation to Alexander duality for monomial ideals in a polynomial ring over a field. We describe ideals that define the non-Cohen-Macaulay- and the non-$(S_i)$-loci of finitely…