Related papers: Regularity and h-polynomials of binomial edge idea…

Let $K_n^h=(V,\binom{V}{h})$ be the complete $h$-uniform hypergraph on vertex set $V$ with $|V|=n$. Baranyai showed that $K_n^h$ can be expressed as the union of edge-disjoint $r$-regular factors if and only if $h$ divides $rn$ and $r$…

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…

Let $R=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$, then $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a shedding…

Let $G$ be a graph consisting of $s$ odd cycles that all share a common vertex. Bhaskara, Higashitani, and Shibu Deepthi recently computed the $h$-polynomial for the quotient ring $R/I_G$, where $I_G$ is the toric ideal of $G$, in terms of…

We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…

Let $G$ be a finite simple graph and let $I(G)$ denote its edge ideal. For $q \ge 1$, the $q$-th squarefree power $I(G)^{[q]}$ is generated by squarefree monomials corresponding to matchings of size $q$ in $G$. We denote by…

The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…

We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…

Symmetric edge polytopes $\mathcal{A}_G$ of type A are lattice polytopes arising from the root system $A_n$ and finite simple graphs $G$. There is a connection between $\mathcal{A}_G$ and the Kuramoto synchronization model in physics. In…

For a graph $G$, Bolognini et al. have shown $J_{G}$ is strongly unmixed $\Rightarrow$ $J_{G}$ is Cohen-Macaulay $\Rightarrow$ $G$ is accessible, where $J_{G}$ denotes the binomial edge ideals of $G$. Accessible and strongly unmixed…

Let $G$ be a finite simple graph and $NI(G)$ be the closed neighborhood ideal of $G$ in the polynomial ring $S=K[V(G)]$. In this paper, we study the Castelnuovo-Mumford regularity, projective dimension and Cohen-Macaulayness of this ideal.…

Let $p$ be a prime number, $\Bbbk$ a field of characteristic $p$ and $G$ a finite $p$-group. Let $V$ be a finite-dimensional linear representation of $G$ over $\Bbbk$. Write $S = \mathrm{Sym} V^*$. For a class of $p$-groups which we call…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I \subset S$ a monomial ideal. Given a vector $\mathfrak{c}\in\mathbb{N}^n$, the ideal $I_{\mathfrak{c}}$ is the ideal generated by those monomials…

For any graph, one can construct a ring, called the edge ring, which is a quadratic-monomial generated subring of the Laurent polynomial ring $k[x_1^{\pm 1},\dots,x_n^{\pm 1}]$. In fact, every quadratic-monomial generated subring of this…

Given a simple graph, consider the polynomial ring with coefficients in a field and variables identified with the edges of the graph. Given a non-empty even cardinality Eulerian subgraph and a choice of half of its edges, consider the…

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…

Let $S=K[x_1,\ldots,x_n]$ be the ring of polynomials over a field $K$. Given two monomial ideals $0\subset I\subsetneq J \subset S$, we present a new method to compute the Hilbert depth of $J/I$. As an application, we show that if $u\in S$…

In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…