Related papers: A hypergraph characterization of nearly complete i…
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…
The notion of quasi $f$-ideals was first presented in $[14]$ which generalize the idea of $f$-ideals. In this paper, we give the complete characterization of quasi $f$-ideals of degree greater or equal to $2$. Additionally, we show that the…
While there has been tremendous activity in the area of statistical network inference on graphs, hypergraphs have not enjoyed the same attention, on account of their relative complexity and the lack of tractable statistical models. We…
We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an…
We prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic…
We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…
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…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
Let $R$ be a normal Noetherian local domain of Krull dimension two. We examine intersections of rank one discrete valuation rings that birationally dominate $R$. We restrict to the class of prime divisors that dominate $R$ and show that if…
In this article, we give a comprehensive survey of the recent progress of research on binomial edge ideal of a graph since 2018.
We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs. Our result solves…
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.
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…
The aim of this survey is to explore complete intersection monomial curves from a contemporary perspective. The main goal is to help readers understand the intricate connections within the field and its potential applications. The…
For an arithmetically Cohen--Macaulay subscheme of projective space, there is a well-known bound for the highest degree of a minimal generator for the defining ideal of the subscheme, in terms of the Hilbert function. We prove a natural…
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
Several algebraic properties of a binomial edge ideal $J_G$ can be interpreted in terms of combinatorial properties of its associated graph $G$. In particular, the so-called cut sets of a graph $G$, special sets of vertices that disconnect…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…