Related papers: Stanley depth of edge ideals

We introduce a persistent commutative algebra for studying the algebraic and combinatorial evolution of edge ideals of graphs and hypergraphs under filtration. Building on the Persistent Stanley--Reisner Theory (PSRT), we develop the notion…

Mader proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, where the equality holds for the complete bipartite digraph ${DK}_{k,n-k}$. For dense…

We prove that every bipartite graph of sufficiently large average degree has either a $K_{t,t}$-subgraph or an induced subgraph of average degree at least $t$ and girth at least $6$. We conjecture that "$6$" can be replaced by "$k$", which…

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

We define nice partitions of the multicomplex associated to a Stanley ideal. As the main result we show that if the monomial ideal $I$ is a CM Stanley ideal, then $I^p$ is a Stanley ideal as well, where $I^p$ is the polarization of $I$.

We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.

We consider ideals $I$ in a Stanley-Reisner ring $k[\Delta]$ over the simplical complex $\Delta$, such that the tight closure of $I$, $I^*$, is equal to $\mathfrak{m}$, the standard graded maximal ideal of $k[\Delta]$. We determine the…

For a graph $G=(V,E)$ the edge ring $k[G]$ is $k[x_1,\ldots,x_n]/I(G)$, where $n=|V|$ and $I(G)$ is generated by $\{ x_ix_j;\{ i,j\}\in E\}$. The conjecture we treat is the following. If $k[G]$ has a 2-linear resolution, then the projective…

In analogy to the skeletons of a simplicial complex and their Stanley--Reisner ideals we introduce the skeletons of an arbitrary monomial ideal $I\subset S=K[x_1,...,x_n]$. This allows us to compute the depth of $S/I$ in terms of its…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching…

We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…

A star edge coloring of a graph is a proper edge coloring with no $2$-colored path or cycle of length four. The star chromatic index $\chi'_{st}(G)$ of $G$ is the minimum number $t$ for which $G$ has a star edge coloring with $t$ colors. We…

Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…

In this work, some combinatorial lower bound for regularity of powers of the edge ideal of a uniform hypergarph is gained. A family of hypergraphs whose regularity of edge ideal attains this bound and has a significant difference from the…

Let $I_{n,m}:=(x_1x_2\cdots x_m,\; x_2x_3\cdots x_{m+1},\; \ldots,\; x_{n-m+1}\cdots x_n)$ be the $m$-path ideal of the path graph of length $n$, in the ring $S=K[x_1,\ldots,x_n]$. We prove that: $$\mathtt{depth}(S/I_{n,m}^t)=\begin{cases}…

We classify all normal edge ideals of edge-weighted graphs.

In this paper, we describe primary decomposition of the edge ideal of the join of some graphs in terms of that information of the edge ideal of every weighted oriented graph. Meanwhile, we also study depth and regularity of symbolic powers…