Related papers: Monomial and toric ideals associated to Ferrers gr…
We introduce a family of squarefree monomial ideals associated to finite simple graphs, whose monomial generators correspond to closed neighborhood of vertices of the underlying graph. Any such ideal is called the closed neighborhood ideal…
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…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
Cut ideals are used in algebraic statistics to study statistical models defined by graphs. Intuitively, topological restrictions on the graphs should imply structural statements about the corresponding cut ideals. Several theorems and many…
In this paper, we study toric ideals generated by circuits. For toric ideals which have squarefree quadratic initial ideals, a sufficient condition to be generated by circuits is given. In particular, squarefree Veronese subrings, the…
We study the vanishing ideal of the parametrized algebraic toric associated to the complete multipartite graph $\G=\mathcal{K}_{\alpha_1,...,\alpha_r}$ over a finite field of order $q$. We give an explicit family of binomial generators for…
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…
In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…
In this article, we study monomial curves, toric ideals and monomial algebras associated to $4$-generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization for…
We study edge partitions of a bipartite graph into induced-$2K_2$-free bipartite graphs, i.e.\ into Ferrers (chain) graphs. We define $\fp(G)$ as the minimum number of parts in such a partition. We prove general lower and upper bounds in…
The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph.…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
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…
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs…
In this paper we introduce $p-$Ferrer diagram, note that $1-$ Ferrer diagram are the usual Ferrer diagrams or Ferrer board, and corresponds to planar partitions. To any $p-$Ferrer diagram we associate a $p-$Ferrer ideal. We prove that…
Given a square-free monomial ideal $I$ in a polynomial ring $R$ over a field $\mathbb{K}$, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the…
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…
For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…
Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…