Related papers: Depth stability of cover ideals

A graph $H$ is an immersion of a graph $G$ if $H$ can be obtained by some sugraph $G$ after lifting incident edges. We prove that there is a polynomial function $f:\Bbb{N}\times\Bbb{N}\rightarrow\Bbb{N}$, such that if $H$ is a connected…

Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the…

The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a very well-covered graph then for all $s \geq 2$ the regularity of $I(G)^s$ is exactly $2s+\nu(G)-1$.

Given arbitrary homogeneous ideals $I$ and $J$ in polynomial rings $A$ and $B$ over a field $k$, we investigate the depth and the Castelnuovo-Mumford regularity of powers of the sum $I+J$ in $A \otimes_k B$ in terms of those of $I$ and $J$.…

We compute the deformation space of quadratic letterplace ideals $L(2,P)$ of finite posets $P$ when its Hasse diagram is a rooted tree. These deformations are unobstructed. The deformed family has a polynomial ring as the base ring. The…

Let $\mathcal{F}$ be a family of fixed graphs and let $d$ be large enough. For every $d$-regular graph $G$, we study the existence of a spanning $\mathcal{F}$-free subgraph of $G$ with large minimum degree. This problem is well-understood…

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

Let $I\subset S=\KK[x_1,...,x_n]$ be a lexsegment ideal, generated by monomials of degree $d$. The main aim of this paper is to characterize when the Hilbert depth of $I$ will be 1, in the standard graded case. In addition to this, we will…

We study the regularity of binomial edge ideals. For a closed graph $G$ we show that the regularity of the binomial edge ideal $J_G$ coincides with the regularity of $\ini_{\lex}(J_G)$ and can be expressed in terms of the combinatorial data…

For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results. Although the studies in this direction are successful, we still need a…

We consider a bipartite distance-regular graph $G$ with diameter $D$ at least 4 and valency $k$ at least 3. We obtain upper and lower bounds for the local eigenvalues of $G$ in terms of the intersection numbers of $G$ and the eigenvalues of…

In this paper, we consider one-to-one matchings between two disjoint groups of agents. Each agent has a preference over a subset of the agents in the other group, and these preferences may contain ties. Strong stability is one of the…

The purpose of this article is to study the space of stability conditions $\stab(P_n)$ on the bounded derived category $\D^b(P_n)$ of finite dimensional representations of a quiver $P_n$ with two vertices and $n$ parallel arrows. There is a…

We show that for a graph $G$ with the vertex set $V$ and the largest eigenvalue $\lambda_{\max}(G)$, letting $$ M(G) := \max_{X,Y \subset V} \frac{e(X,Y)}{\sqrt{|X||Y|}} $$ (where $e(X,Y)$ denotes the number of edges between $X$ and $Y$),…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $I$ is a squarefree monomial ideal of $S$. For every integer $k\geq 1$, we denote the $k$-th squarefree…

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by four squarefree monomials of degrees $d$ and others of…

The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…

A graph $G$ is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any $k$ the $k$-th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality $k$…