On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1

DOI10.1080/10586458.2017.1382403zbMath1415.05114OpenAlexW2771647854MaRDI QIDQ5382933

No author found.

Publication date: 19 June 2019

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2017.1382403

zbMATH Keywords

sum-free setsSchur numbersweak Schur numbersweakly sum-free setsRado numbersweak Rado numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (1)

Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)

Uses Software

• CBack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak Schur numbers and the search for G. W. Walker's lost partitions
• A new method to construct lower bounds for van der Waerden numbers
• A lower bound for Schur numbers and multicolor Ramsey numbers
• Symmetric sum-free partitions and lower bounds for Schur numbers
• Rado numbers for the equation \(\sum_{i=1}^{m-1} x_i + c = x_m\), for negative values of \(c\)
• Two-color Rado numbers for \(x+y+c=kz\)
• Studien zur Kombinatorik
• Satisfiability and computing van der Waerden numbers
• On the finiteness of some \(n\)-color Rado numbers
• Determination of the two-color Rado number for \(a_{1}x_{1}+\cdots +a_m x_m=x_{0}\)
• On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$
• The van der Waerden NumberW(2, 6) Is 1132

This page was built for publication: On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1