Related papers: Zero-sum Generalized Schur Numbers

Given a proper total $k$-coloring $c:V(G)\cup E(G)\to\{1,2,\ldots,k\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \sum_{uv \in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose…

There exists a minimum integer $N$ such that any 2-coloring of $\{1,2,...,N\}$ admits a monochromatic solution to $x+y+kz =\ell w$ for $k,\ell \in \mathbb{Z}^+$, where $N$ depends on $k$ and $\ell$. We determine $N$ when $\ell-k \in…

For any graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges, and a positive integer $r$, by $\chi'_{\Sigma,r}(G)$ we denote the $r$-distant sum distinguishing index of $G$. This is the least integer $k$ for which a…

We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over $\mathbb{Z}$, Graphs Combin. 32 (2016), 49--63]. For a positive integer $m\geq 2$, $m\neq 4$, there are…

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$ colours from $\{1,\ldots,r\}$, then one of the colours contains a monochromatic clique…

In this article, we study a sum of squares of integers except for a fixed one. For any nonnegative integer $n$, we find the minimum number of squares of integers except for $n$ whose sums represent all positive integers that are represented…

A total $k$-coloring of a graph $G$ is a coloring of $V(G)\cup E(G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic number $\chi"(G)$ of $G$ is the smallest integer $k$ such that…

Consider a positive integer $r$ and a graph $G=(V,E)$ with maximum degree $\Delta$ and without isolated edges. The least $k$ so that a proper edge colouring $c:E\to\{1,2,\ldots,k\}$ exists such that $\sum_{e\ni u}c(e)\neq \sum_{e\ni v}c(e)$…

The $r$-colour Ramsey number $R_r(k)$ is the minimum $n \in \mathbb{N}$ such that every $r$-colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove, for each fixed $r \geqslant 2$,…

Schur studied limits of the arithmetic means $s_n$ of zeros for polynomials of degree $n$ with integer coefficients and simple zeros in the closed unit disk. If the leading coefficients are bounded, Schur proved that $\limsup_{n\to\infty}…

We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…

The chromatic sum $\Sigma(G)$ of a graph $G$ is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present…

Let K be an algebraic number field and O_K be its ring of integers. Let S_K be the set of elements in O_K which are sums of squares in O_K and s(O_K) the minimal number of squares necessary to represent -1in O_K. Let g( S_K ) be the…

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most 1. The equitable chromatic number of a graph $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

We start with a systematic study of the zero-sum Ramsey numbers. For a graph $G$ with $0 \ (\!\!\!\!\mod 3)$ edges, the zero-sum Ramsey number is defined as the smallest positive integer $R(G, \mathbb{Z}_3)$ such that for every $n \geq R(G,…

Let $A=\{a_0,a_1,\ldots,a_{k-1}\}$ be a set of $k$ integers. For any integer $h\ge 1$ and any ordered $k$-tuple of positive integers $\mathbf{r}=(r_0,r_1,\ldots,r_{k-1})$, we define a general $h$-fold sumset, denoted by $h^{(\mathbf{r})}A$,…

For integers k>0 and r>0, a conditional (k,r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r,d(v)} different colors. The smallest…

To any Schur polynomial $s_{\lambda}$ one can associated its derived polynomials $s_{\lambda}{(i)}$ $i=0,\ldots,|\lambda|$ by the rule $$s_{\lambda}(x_1+t,\ldots,x_n+t) = \sum_i s_{\lambda}^{(i)}(x_1,\ldots,x_n) t^i.$$ We conjecture that…