Large minimal sets which force arithmetic progressions

DOI10.1016/0097-3165(86)90097-XzbMath0604.05003MaRDI QIDQ1083448

Ronald L. Graham, Jaroslav Nešetřil

Publication date: 1986

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

zbMATH Keywords

partitionsRamsey theoryarithmetic progressionsvan der Waerden's theoremcritical setscombinatorial lines

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Arithmetic progressions (11B25)

Related Items

A blurred view of Van der Waerden type theorems, Ramsey-type numbers involving graphs and hypergraphs with large girth, Ramsey-type numbers involving graphs and hypergraphs with large girth, On Ramsey families of sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted Ramsey configurations
• Parallel concepts in graph theory
• Studien zur Kombinatorik
• Partitionen und lineare Gleichungssysteme
• Graph Theory and Probability
• Regularity and Positional Games
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Ein kombinatorischer Satz der Elementargeometrie