AbstractWe study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo–Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their complement. Using the above method we obtain sharp upper bounds on the regularity when the complement is a chordal graph, or a cycle, or when the original graph is claw free with no induced 4-cycle in its complement. For the last family we show that the second power of the edge ideal has a linear resolution
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
For path ideals of the square of the line graph we compute the Krull dimension, we characterize the ...
Let G be a simple undirected graph on n vertices. Francisco and VanTuyl have shown that if G is chor...
AbstractWe study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Caste...
AbstractIn this paper, we introduce some reduction processes on graphs which preserve the regularity...
In this thesis, we study the Castelnuovo-Mumford regularity of edge ideals associated to graphs. We ...
Let $I(G)$ be the edge ideal of a simple graph $G$. We prove that $I(G)^2$ has a linear free resolut...
Our aim in this thesis is to compute certain algebraic invariants like primary decomposition, dimens...
Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subset...
For given positive integers $n\geq d$, a $d$-uniform clutter on a vertex set $[n]=\{1,\dots,n\}$ is ...
AbstractWe study the minimal free resolution of a quadratic monomial ideal in the case where the res...
This thesis is in combinatorial commutative algebra. It contains four papers, the first three of whi...
Let G be a bipartite graph and I = I(G) be its edge ideal. The aim of this note is to investigate di...
In this thesis, we study square-free monomial ideals of the polynomial ring S which have a linear re...
In this PhD thesis, we discuss several different results about some homological invariants (e.g., gr...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
For path ideals of the square of the line graph we compute the Krull dimension, we characterize the ...
Let G be a simple undirected graph on n vertices. Francisco and VanTuyl have shown that if G is chor...
AbstractWe study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Caste...
AbstractIn this paper, we introduce some reduction processes on graphs which preserve the regularity...
In this thesis, we study the Castelnuovo-Mumford regularity of edge ideals associated to graphs. We ...
Let $I(G)$ be the edge ideal of a simple graph $G$. We prove that $I(G)^2$ has a linear free resolut...
Our aim in this thesis is to compute certain algebraic invariants like primary decomposition, dimens...
Let $I$ and $J$ be edge ideals in a polynomial ring $R = \mathbb{K}[x_1,\ldots,x_n]$ with $I \subset...
For given positive integers $n\geq d$, a $d$-uniform clutter on a vertex set $[n]=\{1,\dots,n\}$ is ...
AbstractWe study the minimal free resolution of a quadratic monomial ideal in the case where the res...
This thesis is in combinatorial commutative algebra. It contains four papers, the first three of whi...
Let G be a bipartite graph and I = I(G) be its edge ideal. The aim of this note is to investigate di...
In this thesis, we study square-free monomial ideals of the polynomial ring S which have a linear re...
In this PhD thesis, we discuss several different results about some homological invariants (e.g., gr...
AbstractWe introduce the class of lattice-linear monomial ideals and use the lcm-lattice to give an ...
For path ideals of the square of the line graph we compute the Krull dimension, we characterize the ...
Let G be a simple undirected graph on n vertices. Francisco and VanTuyl have shown that if G is chor...