Iterated combinatorial density theorems

DOI10.1016/0097-3165(90)90008-KzbMath0738.05008OpenAlexW2144310528MaRDI QIDQ1813782

Ronald L. Graham, Peter Frankl, Vojtěch Rödl

Publication date: 25 June 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(90)90008-k

zbMATH Keywords

finite sums theoremsfinite unions theoremiterated density results

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Ramsey theory (05D10)

Related Items

Density versions of Schur's theorem for ideals generated by submeasures, Ideal version of Ramsey’s theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A density statement generalizing Schur's theorem
• Induced restricted Ramsey theorems for spaces
• Density versions of two generalizations of Schur's theorem
• Quantitative theorems for regular systems of equations
• Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
• Partitionstheoreme für Graphen
• Studien zur Kombinatorik
• Finite sums from sequences within cells of a partition of N
• Errata to ``Ramsey's theorem for a class of categories
• Partitionen und lineare Gleichungssysteme
• On sets of integers containing k elements in arithmetic progression
• A family of countable homogeneous graphs