A problem of Schur and its generalizations

DOI10.4064/AA-20-2-175-187zbMATH Open0207.54802OpenAlexW1599568942MaRDI QIDQ5608697FDOQ5608697

Authors: H. L. Abbott, D. Hanson 

Publication date: 1972

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/205076

Mathematics Subject Classification ID

Partitions of sets (05A18) Ramsey theory (05D10)

Cited In (19)

• Modular Schur numbers
• Weak Schur numbers and the search for G. W. Walker's lost partitions
• Partitioning a power set into union-free classes
• On the multi-colored Ramsey numbers of cycles
• On Rado's boundedness conjecture
• New upper bound for multicolor Ramsey number of odd cycles
• Multicolour Ramsey numbers of odd cycles
• The Shannon capacity of a communication channel, graph Ramsey number and a conjecture of Erdős
• Lower bounds for some Ramsey numbers
• Lower bounds on the weak Schur numbers up to 9 colors
• On the \(n\)-color Rado number for the equation \(x_{1}+x_{2}+\cdots +x_{k}+c =x_{k+1}\)
• A generalised linear Ramsey graph construction
• The multi-color Ramsey number of an odd cycle
• Sum-Free Sets of Integers
• Generalised Ramsey numbers for small graphs
• Maximum union-free subfamilies
• On Ramsey numbers for circuits
• Semi-algebraic Ramsey numbers
• Sum-free sets and 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)