On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$

DOI10.1090/mcom3034zbMath1332.05011OpenAlexW1953905712MaRDI QIDQ2796031

No author found.

Publication date: 23 March 2016

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/mcom3034

zbMATH Keywords

sum-free setsSAT problemSAT solverSchur numbersBoolean variablesRado numbers

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions; congruences and congruential restrictions (11P83) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (7)

On the finiteness of some \(n\)-color Rado numbers ⋮ Unnamed Item ⋮ On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1 ⋮ Unnamed Item ⋮ Exact value of 3 color weak Rado number ⋮ A general lower bound on the weak Schur number ⋮ Two-color Rado number of \(x + y + c = kz\) for odd \(c\) and \(k\) with \(k \geq c + 6\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak Schur numbers and the search for G. W. Walker's lost partitions
• A lower bound for Schur numbers and multicolor Ramsey numbers
• Symmetric sum-free partitions and lower bounds for Schur numbers
• Difference Ramsey numbers and Issai 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
• An improved upper bound for Ramsey number \(R(3,3,3,3;2)\)
• The Ramsey number N(3,3,3,3;2)
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
• A problem of Schur and its generalizations

This page was built for publication: On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$