When $S$ is a polynomial ring or more generally a standard graded algebra over a field $K$, with homogeneous maximal ideal $𝔪$, it is known that for an ideal $I$ of $S$, the regularity of powers of $I$ becomes eventually a linear function, i.e., $\mathrm{reg}\left(I^m\right)=dm+e$ for $m\gg 0$ and some integers $d$, $e$. This motivates writing $\mathrm{reg}\left(I^m\right)=dm+e_m$ for every $m\ge 0$. The sequence $e_m$, called the of the ideal $I$, is the subject of much research and its nature is still widely unexplored. We know that $e_m$ is eventually constant. In this article, after proving...

A graph $G$ is $H$-saturated if it contains no $H$ as a subgraph, but does contain $H$ after the addition of any edge in the complement of $G$. The saturation number, $\mathrm{sat}(n,H)$, is the minimum number of edges of a graph in the set of all $H$-saturated graphs of order $n$. We determine the saturation number $\mathrm{sat}(n,P_6+t{P}_2)$ for $n\ge \frac{10}{3}t+10$ and characterize the extremal graphs for $n>\frac{10}{3}t+20$.

Let $G$ be a finite simple graph with the vertex set $V$ and let $I_G$ be its edge ideal in the polynomial ring $S=𝕂\left[V\right]$. We compute the depth and the Castelnuovo-Mumford regularity of $S/I_G$ when $G=G_1\circ G_2$ or $G=G_1*G_2$ is a graph obtained from Cohen-Macaulay bipartite graphs $G_1$, $G_2$ by the $\circ$ operation or $*$ operation, respectively.

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let $G$ be a bridgeless simple graph with minimum degree at least $3$. Jackson and Yoshimoto (2007) showed that $G$ has an even factor containing two arbitrary prescribed edges. They also proved that $G$ has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges $e_1$ and $e_2$ of $G$, there is an even factor containing $e_1$ and $e_2$...

The generalized $k$-connectivity ${\kappa }_k\left(G\right)$ of a graph $G$ was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized $k$-edge-connectivity which is defined as ${\lambda }_k\left(G\right)=min\{\lambda \left(S\right):S\subseteq V\left(G\right)$ and $\left|S\right|=k\}$, where $\lambda \left(S\right)$ denotes the maximum number $\ell$ of pairwise edge-disjoint trees $T_1,T_2,...,T_{\ell }$ in $G$ such that $S\subseteq V\left(T_i\right)$ for $1\le i\le \ell$. In this paper we prove that for any two connected graphs $G$ and $H$ we have ${\lambda }_3(G\square H)\ge {\lambda }_3\left(G\right)+{\lambda }_3\left(H\right)$, where $G\square H$ is the Cartesian product of $G$ and $H$. Moreover, the bound is sharp. We also...

Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph $G$, a hereditary graph property $𝒫$ and $l\ge 1$ we define ${\chi }_{𝒫,l}^{\text{'}}\left(G\right)$ to be the minimum number of colours needed to properly colour the edges of $G$, such that any subgraph of $G$ induced by edges coloured by (at most) $l$ colours is in $𝒫$. We present a necessary and sufficient condition for the existence of ${\chi }_{𝒫,l}^{\text{'}}\left(G\right)$. We focus on edge-colourings of graphs with respect to the hereditary...

Let $𝔞\subseteq ℂ[x_1,...,x_n]$ be a monomial ideal and $𝒥\left({𝔞}^c\right)$ the multiplier ideal of $𝔞$ with coefficient $c$. Then $𝒥\left({𝔞}^c\right)$ is also a monomial ideal of $ℂ[x_1,...,x_n]$, and the equality $𝒥\left({𝔞}^c\right)=𝔞$ implies that $0<c<n+1$. We mainly discuss the problem when $𝒥\left(𝔞\right)=𝔞$ or $𝒥\left({𝔞}^{n+1-\epsilon }\right)=𝔞$ for all $0<\epsilon <1$. It is proved that if $𝒥\left(𝔞\right)=𝔞$ then $𝔞$ is principal, and if $𝒥\left({𝔞}^{n+1-\epsilon }\right)=𝔞$ holds for all $0<\epsilon <1$ then $𝔞=(x_1,...,x_n)$. One global result is also obtained. Let $\widetilde{𝔞}$ be the ideal sheaf on ${\mathbb{P}}^{n-1}$ associated with $𝔞$. Then it is proved that the equality $𝒥\left(\widetilde{𝔞}\right)=\widetilde{𝔞}$ implies that $\widetilde{𝔞}$ is principal.

Let $G$ be a simple graph, let $d\left(v\right)$ denote the degree of a vertex $v$ and let $g$ be a nonnegative integer function on $V\left(G\right)$ with $0\le g\left(v\right)\le d\left(v\right)$ for each vertex $v\in V\left(G\right)$. A $g_c$-coloring of $G$ is an edge coloring such that for each vertex $v\in V\left(G\right)$ and each color $c$, there are at least $g\left(v\right)$ edges colored $c$ incident with $v$. The $g_c$-chromatic index of $G$, denoted by ${\chi }_{g_c}^{\text{'}}\left(G\right)$, is the maximum number of colors such that a $g_c$-coloring of $G$ exists. Any simple graph $G$ has the $g_c$-chromatic index equal to ${\delta }_g\left(G\right)$ or ${\delta }_g\left(G\right)-1$, where ${\delta }_g\left(G\right)={min}_{v\in V\left(G\right)}\lfloor d\left(v\right)/g\left(v\right)\rfloor$. A graph $G$ is nearly bipartite,...

The line graph of a graph $G$, denoted by $L\left(G\right)$, has $E\left(G\right)$ as its vertex set, where two vertices in $L\left(G\right)$ are adjacent if and only if the corresponding edges in $G$ have a vertex in common. For a graph $H$, define ${\overline{\sigma }}_2\left(H\right)=min\{d\left(u\right)+d\left(v\right):uv\in E\left(H\right)\}$. Let $H$ be a 2-connected claw-free simple graph of order $n$ with $\delta \left(H\right)\ge 3$. We show that, if ${\overline{\sigma }}_2\left(H\right)\ge \frac{1}{7}(2n-5)$ and $n$ is sufficiently large, then either $H$ is traceable or the Ryjáček’s closure $\mathrm{cl}\left(H\right)=L\left(G\right)$, where $G$ is an essentially $2$-edge-connected triangle-free graph that can be contracted to one of the two graphs of order 10...