The authors investigate additional properties of theorems due to Rado's and Schur's (Rado's theorem being the statement that for every r coloring of the positive integers there exist k integers such that all their finite sums - without repetition - are colored the same; Schur's result is \(k=2)\). Using standard constructions sparse versions are established, viz., a graph theoretic result of the authors implies a strong sparse version of Schur's theorem; the probabilistic method is used to derive a weak sparse version of Rado's theorem.
Recommendations
Cites work
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- scientific article; zbMATH DE number 3717358 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- On sets of integers containing k elements in arithmetic progression
- Restricted Ramsey configurations
- Studien zur Kombinatorik
Cited in
(4)
This page was built for publication: On sets of integers with the Schur property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821785)