Rainbow numbers of [n] for _i=1ᵏ-1x_i=x_k

From MaRDI portal
Publication:3300684

zbMATH Open1444.05139arXiv1901.08613MaRDI QIDQ3300684FDOQ3300684


Authors: Kean Fallon, Colin Giles, Hunter Rehm, Simon Wagner, Nathan Warnberg Edit this on Wikidata


Publication date: 29 July 2020

Abstract: Consider the set 1,2,dots,n=[n] and an equation eq. The rainbow number of [n] for eq, denoted operatornamerb([n],eq), is the smallest number of colors such that for every exact operatornamerb([n],eq)-coloring of [n], there exists a solution to eq 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 sumi=1k1xi=xk for k=3 and k=4. The paper also establishes a general lower bound for kge5.


Full work available at URL: https://arxiv.org/abs/1901.08613




Recommendations




Cites Work


Cited In (10)





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)