Weak Schur numbers and the search for G. W. Walker's lost partitions
From MaRDI portal
(Redirected from Publication:418311)
Recommendations
- New lower bounds for weak Schur partitions
- A lower bound for weak Schur numbers with a deterministic algorithm
- Lower bounds on the weak Schur numbers up to 9 colors
- Symmetric sum-free partitions and lower bounds for Schur numbers
- Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)
Cites work
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- A lower bound for Schur numbers and multicolor Ramsey numbers
- A new method to construct lower bounds for van der Waerden numbers
- A problem of Schur and its generalizations
- An extension of Schur's theorem on sum-free partitions
- Backtrack Programming
- On an extension of a theorem of Schur
- Partitions into sum-free sets
- Satisfiability and computing van der Waerden numbers
- Symmetric sum-free partitions and lower bounds for Schur numbers
- The Mathematical Coloring Book
- The van der Waerden NumberW(2, 6) Is 1132
Cited in
(9)- Modular Schur numbers
- Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)
- A general lower bound on the weak Schur number
- On the \(n\)-color weak Rado numbers for the equation \(x_1+x_2+\cdots +x_k+c=x_{k+1}\)
- A lower bound for weak Schur numbers with a deterministic algorithm
- On the \(n\)-color Rado number for the equation \(x_{1}+x_{2}+\cdots +x_{k}+c =x_{k+1}\)
- Lower bounds on the weak Schur numbers up to 9 colors
- Exact value of 3 color weak Rado number
- New lower bounds for weak Schur partitions
This page was built for publication: Weak Schur numbers and the search for G. W. Walker's lost partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418311)
