Related papers: Some Cohen-Macaulay and unmixed binomial edge idea…
We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…
In this paper, we investigate some properties of symbolic powers and symbolic Rees algebras of binomial edge ideals associated with some classes of block graphs. First, it is shown that symbolic powers of binomial edge ideals of pendant…
Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…
In this paper, we first give some sufficient criteria for normality of monomial ideals. As applications, we show that closed neighborhood ideals of complete bipartite graphs are normal, and hence satisfy the (strong) persistence property.…
Diestel and K\"uhn proved that the topological ends of an infinite graph are precisely its undominated graph ends, yielding a canonical embedding of the space of topological ends into the space of graph ends. For edge-ends, introduced by…
We explicitly construct a minimal free resolution of the cover ideals of clique-whiskered graphs. In particular, Cohen--Macaulay chordal graphs, clique corona graphs, and Cohen--Macaulay Cameron--Walker graphs are examples of…
We consider the problem of learning the weighted edges of a balanced mixture of two undirected graphs from epidemic cascades. While mixture models are popular modeling tools, algorithmic development with rigorous guarantees has lagged.…
We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized…
We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show…
We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…
Let $G$ be a permutation graph. We show that $G$ is Cohen-Macaulay if and only if $G$ is unmixed and vertex decomposable. When this is the case, we obtain a combinatorial description for the $a$-invariant of $G$. Moreover, we characterize…
We introduce and study the weighted $r$-path ideal of a weighted graph $G_\omega$, which is a common generalization of Conca and De Negri's $r$-path ideal for unweighted graphs and Paulsen and Sather-Wagstaff's edge ideal of the weighted…
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.
We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically,…
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…
Let $G$ be a simple graph on $n$ vertices. We introduce the notion of bipartite connectivity of $G$, denoted by $\operatorname{bc}(G)$ and prove that $$\lim_{s \to \infty} \operatorname{depth} (S/I(G)^{(s)}) \le \operatorname{bc}(G),$$…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free. A converse of this statement is proved for a class of chordal and claw free graphs.
In this paper, we mainly study the Castelnuovo-Mumford regularity of the generalized binomial edge ideals of graphs. We show that this number can be any integer number from $2$ to $n-1$ where $n$ is the number of vertices in the underlying…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…