A problem of Schur and its generalizations
From MaRDI portal
Cited in
(22)- Partitioning a power set into union-free classes
- Sum-free sets and Ramsey numbers
- The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
- New upper bound for multicolor Ramsey number of odd cycles
- On Ramsey numbers for circuits
- Generalised Ramsey numbers for small graphs
- Multicolour Ramsey numbers of odd cycles
- On the \(n\)-color Rado number for the equation \(x_{1}+x_{2}+\cdots +x_{k}+c =x_{k+1}\)
- On the multi-colored Ramsey numbers of cycles
- The multi-color Ramsey number of an odd cycle
- Maximum union-free subfamilies
- Modular Schur numbers
- Sum-Free Sets of Integers
- Weak Schur numbers and the search for G. W. Walker's lost partitions
- A generalised linear Ramsey graph construction
- Lower bounds on the weak Schur numbers up to 9 colors
- Lower bounds for some Ramsey numbers
- Rainbow and Gallai-Rado numbers involving binary function equations
- On product Schur triples in the integers
- Near-tight closure bounds for the Littlestone and threshold dimensions
- On Rado's boundedness conjecture
- Semi-algebraic Ramsey numbers
This page was built for publication: A problem of Schur and its generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5608697)
