Weak Schur numbers and the search for G. W. Walker's lost partitions
From MaRDI portal
Publication:418311
DOI10.1016/j.camwa.2011.11.006zbMath1238.11031OpenAlexW1995904914MaRDI QIDQ418311
Publication date: 28 May 2012
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2011.11.006
Related Items
New lower bounds for weak Schur partitions, Modular Schur numbers, Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\), On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1, Exact value of 3 color weak Rado number, A lower bound for weak Schur numbers with a deterministic algorithm, On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$, A general lower bound on the weak Schur number, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Satisfiability and computing van der Waerden numbers
- On an extension of a theorem of Schur
- The Mathematical Coloring Book
- The van der Waerden NumberW(2, 6) Is 1132
- Backtrack Programming
- A problem of Schur and its generalizations
- An extension of Schur's theorem on sum-free partitions
