Related papers: Jump Sequences of Edge Ideals
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
The most useful and interesting line bundles over algebraic curves of a very high genus have the ratio \delta of the degree to the genus close to half-integer values, usually \delta \approx 0, \delta \approx 1/2, or \delta \approx 1; the…
A set of meet-irreducible ideals is described for a class of maximal triangular almost finite algebras. This set forms a topological space under the hull-kernel closure, and there is a one-to-one correspondence between closed sets in this…
In this paper, we characterize all graphs $G$ satisfying \[\operatorname{reg}(S/J_G)=\ell(G)=c(G)\] where $\ell(G)$ is the sum of the lengths of the longest induced paths in each connected component of $G$ and $c(G)$ is the number of the…
One way to define the Matching Cut problem is: Given a graph $G$, is there an edge-cut $M$ of $G$ such that $M$ is an independent set in the line graph of $G$? We propose the more general Conflict-Free Cut problem: Together with the graph…
An adjacent vertex distinguishing edge colouring of a graph $G$ without isolated edges is its proper edge colouring such that no pair of adjacent vertices meets the same set of colours in $G$. We show that such colouring can be chosen from…
The stratum St(J,<) (the homogeneous stratum Sth(J,<) respectively) of a monomial ideal J in a polynomial ring R is the family of all (homogeneous) ideals of R whose initial ideal with respect to the term order < is J. St(J,<) and Sth(J,<)…
We 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…
We provide a closed formula for the graded Betti numbers in the linear strands of all powers of binomial edge ideals $J_G$ arising from closed graphs $G$ that do not have the complete graph $K_4$ as an induced subgraph. We show that these…
Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…
We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…
Let $T$ be a perfect binary tree and $I$ be its edge ideal in the polynomial ring $S$. We determine the vertex cover number, independent number, and establish the recursive formula to compute the number of minimal vertex covers. As a…
A class of non-compact billiards is introduced, namely the infinite step billiards, i.e., systems of a point particle moving freely in the domain $\Omega = \bigcup_{n\in\N} [n,n+1] \times [0,p_n]$, with elastic reflections on the boundary;…
Using the theory of "higher structure maps" from generic rings for free resolutions of length three, we give a classification of grade 3 perfect ideals with small type and deviation in local rings of equicharacteristic zero, extending the…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a…
We extend several $g$-type theorems for connected, orientable homology manifolds without boundary to manifolds with boundary. As applications of these results we obtain K\"uhnel-type bounds on the Betti numbers as well as on certain…
We introduce a new graph-theoretic concept in the area of network monitoring. A set $M$ of vertices of a graph $G$ is a \emph{distance-edge-monitoring set} if for every edge $e$ of $G$, there is a vertex $x$ of $M$ and a vertex $y$ of $G$…
Starting with a grade three perfect ideal $I \subset R$, we demonstrate how to produce the a self-dual resolution of length four using the resolution of the original ideal. This process is also reversible. The main case of interest is when…