On the n-color weak Rado numbers for the equation x₁+x₂+ +x_k+c=x_k+1
From MaRDI portal
Publication:5382933
Recommendations
- On the \(n\)-color Rado number for the equation \(x_{1}+x_{2}+\cdots +x_{k}+c =x_{k+1}\)
- Exact value of 3 color weak Rado number
- Rado numbers for the equation x₁+3x₂+c=x₃
- Two-color Rado numbers for the equations \(2x_1 + 2x_2 + c = x_3\) and \(2x_1 +2x_2 + 2x_3 + c = x_4\)
- scientific article; zbMATH DE number 7604104
Cites work
- A lower bound for Schur numbers and multicolor Ramsey numbers
- A new method to construct lower bounds for van der Waerden numbers
- Determination of the two-color Rado number for \(a_{1}x_{1}+\cdots +a_m x_m=x_{0}\)
- Distinct Rado numbers for x₁+x₂+c=x₃.
- scientific article; zbMATH DE number 5139430 (Why is no real title available?)
- scientific article; zbMATH DE number 637325 (Why is no real title available?)
- scientific article; zbMATH DE number 1156683 (Why is no real title available?)
- On the \(n\)-color Rado number for the equation \(x_{1}+x_{2}+\cdots +x_{k}+c =x_{k+1}\)
- On the finiteness of some n-color Rado numbers
- Partitions into sum-free sets
- Rado numbers for the equation \(\sum_{i=1}^{m-1} x_i + c = x_m\), for negative values of \(c\)
- Satisfiability and computing van der Waerden numbers
- Studien zur Kombinatorik
- Symmetric sum-free partitions and lower bounds for Schur numbers
- The van der Waerden NumberW(2, 6) Is 1132
- Two-color Rado numbers for x+y+c=kz
- Weak Schur numbers and the search for G. W. Walker's lost partitions
Cited in
(3)
This page was built for publication: On the \(n\)-color weak Rado numbers for the equation \(x_1+x_2+\cdots +x_k+c=x_{k+1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382933)
