Rainbow numbers of [n] for _i=1ᵏ-1x_i=x_k
From MaRDI portal
Publication:3300684
Abstract: Consider the set and an equation . The rainbow number of for , denoted , is the smallest number of colors such that for every exact -coloring of , there exists a solution to with every member of the solution set assigned a distinct color. This paper focuses on linear equations and, in particular, establishes the rainbow number for the equations for and . The paper also establishes a general lower bound for .
Recommendations
Cites work
- Anti-van der Waerden numbers of 3-term arithmetic progression
- Anti-van der Waerden numbers of graph products
- On rainbow arithmetic progressions
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Rainbow arithmetic progressions
- Rainbow-free colorings for x+y=cz in Z_p
- The structure of rainbow-free colorings for linear equations on three variables in \(\mathbb Z_{p}\)
Cited in
(10)- Rainbow Solutions to the Sidon Equation in Cyclic Groups
- On the rainbow numbers of \(\mathbb{Z}_n\) for \(x_1 + x_2 = 4x_3\)
- On the rainbow version of a problem of Roth
- Rainbow numbers of $[m] \times [n]$ for $x_1 + x_2 = x_3$
- Rainbow solutions of a linear equation with coefficients in \(\mathbb{Z}/p\mathbb{Z}\)
- Rainbow numbers for the generalized Schur equation \(x_1+x_2+\cdots+x_{m-1}=x_m\)
- Anti-van der Waerden numbers of graph products of cycles
- Rainbow numbers for \(x_1+x_2=kx_3\) in \(\mathbb{Z}_n\)
- Rainbow numbers of \(\mathbb{Z}_n\) for \(a_1x_1+a_2x_2+a_3x_3 =b\)
- The anti-Ramsey problem for the Sidon equation
This page was built for publication: Rainbow numbers of \([n]\) for \(\sum_{i=1}^{k-1}x_i=x_k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300684)