Abstract
We investigate sets of integers for which Rado and Schur theorems are true from the point of view of their local density. We establish the existence of locally sparse Rado and Schur sets in a strong sense.
Similar content being viewed by others
References
Erdös, P., Hajnal, A.: On chromatic number of graphs and set systems. Acta Math. Acad. Sci. Hung.17, 61–99 (esp. 94–99) (1966)
Erdös, P., Nešetřil, J., Rödl, V.: On Pisier type problems and results (in preparation)
Graham, R.L.: Rudiments of Ramsey theory. Reg. Conf. Ser. Math.45, (1981)
Nešetřil, J., Rödl, V.: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Comb. Theory (B)27, 225–227 (1979)
Nešetřil, J., Rödl, V.: Partition Theory and its Applications. London Math. Soc. Lect. Note Ser.38, 96–157 (1979)
Nešetřil, J., Rödl, V.: Dual Ramsey Type Theorems. In: Proc. of VIII Winter School on Abstract Analysis, edited by Z. Frolik, pp. 121–123. Prague 1980
Nešetřil, J., Rödl, V.: Finite Union Theorem with restrictions. Graphs and Combinatorics (to appear)
Schur, I.: Uber die Kongruenzx m +y m congruentz m (modp). Jahresber Dtsch. Math.-Ver., 114–116 (1916)
Spencer, J.: Restricted Ramsey Configuration. J. Comb. Theory (A)19, 277–286 (1975)
Szemirédi, E.: On sets of integers containing nok elements in arithmetic progression. Acta Arith.27, 199–245 (1975)
Rado, R.: Studien zur Kombinatorik. Math. Z.36, 424–480 (1933)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nešetřil, J., Rödl, V. On sets of integers with the Schur property. Graphs and Combinatorics 2, 269–275 (1986). https://doi.org/10.1007/BF01788101
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01788101