Finite union theorem with restrictions

DOI10.1007/BF01788110zbMath0651.05012OpenAlexW2047403153MaRDI QIDQ1106223

Jaroslav Nešetřil, Vojtěch Rödl

Publication date: 1986

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788110

zbMATH Keywords

Folkman-Rado-Sanders Finite Union Theorem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Related Items (4)

Induced restricted Ramsey theorems for spaces ⋮ Some combinatorially defined subsets of \(\beta \mathbb N\) and their relation to the idempotents ⋮ Compact subsemigroups of (βℕ, +) containing the idempotents ⋮ Partition regular structures contained in large sets are abundant

Cites Work

• Restricted Ramsey configurations
• The Ramsey property for graphs with forbidden complete subgraphs
• Another proof of the Folkman-Rado-Sanders theorem
• Studien zur Kombinatorik
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite union theorem with restrictions