Related papers: Minimal Reductions and Cores of Edge Ideals

Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which…

A matching cut is a matching that is also an edge cut. In the problem Minimum Matching Cut, we ask for a matching cut with the minimum number of edges in the matching. We investigate the differences in complexity between Minimum Matching…

Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$, let $G$ be the underlying graph of $D$, and let $I^{(n)}$ be the $n$-th symbolic power of $I$ defined using the minimal primes of $I$. We prove that $I^2=I^{(2)}$ if and only…

We study two extremal problems about subgraphs excluding a family $\F$ of graphs. i) Among all graphs with $m$ edges, what is the smallest size $f(m,\F)$ of a largest $\F$--free subgraph? ii) Among all graphs with minimum degree $\delta$…

Let $D$ be a weighted oriented graph with the underlying graph $G$ and $I(D), I(G) $ be the edge ideals corresponding to $D$ and $G$ respectively. We show that the regularity of edge ideal of a certain class of weighted oriented graph…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

Let $I$ be the edge ideal of a connected non-bipartite graph and $R$ the base polynomial ring. Then $\operatorname{depth} R/I \ge 1$ and $\operatorname{depth} R/I^t = 0$ for $t \gg 1$. We give combinatorial conditions for…

A directed graph is oriented if it can be obtained by orienting the edges of a simple, undirected graph. For an oriented graph $G$, let $\beta(G)$ denote the size of a minimum feedback arc set, a smallest subset of edges whose deletion…

In this paper we use polarization to study the behavior of the depth and regularity of a monomial ideal $I$, locally at a variable $x_i$, when we lower the degree of all the highest powers of the variable $x_i$ occurring in the minimal…

We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all $(n-1)$-minors of a symmetric $n \times n$ matrix whose entries in the upper triangle are…

This paper is a continuation of a previous work by the author and G. Puninski where iterated intersections of powers of ideals were studied in rings of iterated differential polynomials. We present a method which can be used to show that…

The aims of this work are to study Rees algebras of filtrations of monomial ideals associated to covering polyhedra of rational matrices with non-negative entries and non-zero columns using combinatorial optimization and integer…

Let R be a commutative ring with a non-zero identity. In this paper, we define a new graph, the compressed intersection annihilator graph, denoted by $IA(R)$, and investigate some of its theoretical properties and its relation with the…

We define a simple graph as compact if it lacks even cycles and satisfies the odd-cycle condition. Our focus is on classifying all compact graphs and examining the characteristics of their edge rings. Let $G$ be a compact graph and…

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…

Given a nontrivial homogeneous ideal $I\subseteq k[x_1,x_2,\ldots,x_d]$, a problem of great recent interest has been the comparison of the $r$th ordinary power of $I$ and the $m$th symbolic power $I^{(m)}$. This comparison has been…

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

We look at the question of which distance-regular graphs are core-complete, meaning they are isomorphic to their own core or have a complete core. We build on Roberson's homomorphism matrix approach by which method he proved the…

The core of an module is the intersection of all its reductions. The main result asserts that the core of a finitely generated, torsion-free, integrally closed module over a two dimensional regular local ring is the product of the module…