Related papers: Dirac's theorem and multigraded syzygies

We introduce the concept of matching powers of monomial ideals. Let $I$ be a monomial ideal of $S=K[x_1,\dots,x_n]$, with $K$ a field. The $k$th matching power of $I$ is the monomial ideal $I^{[k]}$ generated by the products $u_1\cdots u_k$…

We characterize the graphs $G$ for which their toric ideals $I_G$ are complete intersections. In particular we prove that for a connected graph $G$ such that $I_G$ is complete intersection all of its blocks are bipartite except of at most…

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…

Let $R = \mathbb{K}[x_1, \ldots, x_n]$ and $I \subset R$ be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of $R/I$. As a consequence, we prove that if $I$ is generated by…

A recent paper of Balogh, Li and Treglown initiated the study of Dirac-type problems for ordered graphs. In this paper we prove a number of results in this area. In particular, we determine asymptotically the minimum degree threshold for…

One of the foundational theorems of extremal graph theory is Dirac's theorem, which says that if an n-vertex graph G has minimum degree at least n/2, then G has a Hamilton cycle, and therefore a perfect matching (if n is even). Later work…

Let $I_{G} \subset K[x_{1},...,x_{m}]$ be the toric ideal associated to a finite graph $G$. In this paper we study the binomial arithmetical rank and the $G$-homogeneous arithmetical rank of $I_G$ in 2 cases: $G$ is bipartite, $I_G$ is…

In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a…

Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…

Let $I(G)$ be the edge ideal of a gapfree graph $G$. An open conjecture of Nevo and Peeva states that $I(G)^q$ has linear resolution for $q\gg 0$. We present a promising approach to this challenging conjecture by investigating the stronger…

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…

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

The cycle space $\mathcal{C}(G)$ of a graph $G$ is defined as the linear space spanned by all cycles in $G$. For an integer $k\ge 3$, let $\mathcal{C}_k (G)$ denote the subspace of $\mathcal{C}(G)$ generated by the cycles of length exactly…

It has been conjectured that the toric ideal of the base ring of a discrete polymatroid is generated by symmetric exchange binomials. In the present paper, we give several classes of discrete polymatroids which yield toric ideals generated…

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We…

We provide an optimal sufficient condition, relating minimum degree and bandwidth, for a graph to contain a spanning subdivision of the complete bipartite graph $K_{2,\ell}$. This includes the containment of Hamilton paths and cycles, and…

B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…

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 graph with $n$ vertices, $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$ and $I(G)$ denote the edge ideal of $G$. For every collection $\mathcal{H}$ of connected graphs with…