For all graphs on at most four edges, the paper lists exact balance, strong-balance, and omnitonal numbers, and proves that the union of two bipartite graphs with the same edge count is balanceable.
Zero-sum Generalized Schur Numbers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$ with $\sum_{i=1}^{k} \chi(x_i) \equiv 0 \,(\mathrm{mod }\,r)$. We give some formulas and lower bounds for various instances.
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On small balanceable, strongly-balanceable and omnitonal graphs
For all graphs on at most four edges, the paper lists exact balance, strong-balance, and omnitonal numbers, and proves that the union of two bipartite graphs with the same edge count is balanceable.