Related papers: On vertex decomposable simplicial complexes and th…

In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\T{reg}(R/I(G))= c_G$, where…

The study of the edge ideal $I(D_{G})$ of a weighted oriented graph $D_{G}$ with underlying graph $G$ started in the context of Reed-Muller type codes. We generalize a Cohen-Macaulay construction for $I(D_{G})$, which Villarreal gave for…

We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.

Let $D$ be a multidigraph. We study the simplicial complex $\mathrm{Dlf}(D)$, whose vertices are the directed edges of $D$ and whose faces correspond to directed linear forests, that is, vertex-disjoint unions of directed paths. We also…

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Let $\Delta$ be simplicial complex and let $k[\Delta]$ denote the Stanley--Reisner ring corresponding to $\Delta$. Suppose that $k[\Delta]$ has a pure free resolution. Then we describe the Betti numbers and the Hilbert--Samuel multiplicity…

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 provide new short proofs of some theorems from the literature…

We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…

Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the…

Given a graph $G$, the non-cover complex of $G$ is the combinatorial Alexander dual of the independence complex of $G$. Aharoni asked if the non-cover complex of a graph $G$ without isolated vertices is $(|V(G)|-i \gamma(G)-1)$-collapsible…

Let $S = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $\Delta$ be a simplicial complex on $[n] = \{1, ..., n \}$ and $I_\Delta \subset S$ its Stanley--Reisner ideal. We write…

An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or…

Let $\pi=\{V_1,\dots,V_r\}$ be an equitable partition of the vertex set of a directed graph (digraph) $X$. It is well known that the characteristic polynomial $\phi(X/\pi,x)$ of a quotient graph $X/\pi$ divides that of $X$, but the…

A natural extension of bipartite graphs are $d$-partite clutters, where $d \geq 2$ is an integer. For a poset $P$, Ene, Herzog and Mohammadi introduced the $d$-partite clutter $\mathcal{C}_{P,d}$ of multichains of length $d$ in $P$, showing…

The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…

A simplicial complex $\Delta$ is a virtually Cohen-Macaulay simplicial complex if its associated Stanley-Reisner ring $S$ has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length ${\rm codim}(S)$. We provide a…

In this article, we discuss the vertex decomposability of three well-studied simplicial complexes associated to forests. In particular, we show that the bounded degree complex of a forest and the complex of directed trees of a multidiforest…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

We prove that if $G$ is a graph and $r_1, ..., r_k \in \mathbb{Z}_{\geq 0}$ such that $\sum_{i=1}^k r_i \geq \Delta(G) + 2 - k$ then $V(G)$ can be partitioned into sets $V_1, ..., V_k$ such that $\Delta(G[V_i]) \leq r_i$ and $G[V_i]$…

For a metric space $(X, d)$ and a scale parameter $r \geq 0$, the Vietoris-Rips complex $\mathcal{VR}(X;r)$ is a simplicial complex on vertex set $X$, where a finite set $\sigma \subseteq X$ is a simplex if and only if diameter of $\sigma$…